Sorting

**1.**The time complexity of the normal quick sort, randomized quick sort algorithms in the worst case is

**2.**Let there be an array of length ‘N’, and the selection sort algorithm is used to sort it, how many times a swap function is called to complete the execution?

**3.**Sorting is not possible by using which of the following methods?

**4.**For the bubble sort algorithm, what is the time complexity of the best/worst case? (assume that the computation stops as soon as no more swaps in one pass)

**5.**For the quick sort algorithm, what is the time complexity of the best/worst case?

**6.**Which of following algorithm scans the list by swapping the entries whenever pair of adjacent keys are out of desired order?

**7.**Identify the name of the sorting in which time is not proportional to n2.

**8.**. Identify the name of the sorting in which time is not proportional to n2.

**9.**This algorithm scans the list by swapping the entries whenever pair of adjacent keys are out of desired order.

**10.**Quick sort invented by _____________