Considering the pseudo code of quick sort


Considering the pseudo code of Quick Sort discussed in lecture answer the followingquestions (you need to justify your answers as well),
a. What will be the running time of Quick Sort if input is sorted in ascending
order
b. What will be the running time of Quick Sort if input is sorted in descending
order
c. What is best case input (format of input resulting in best case time) for Quick
Sort. 

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: Considering the pseudo code of quick sort
Reference No:- TGS0145741

Expected delivery within 24 Hours