Quick Sort Presentation Quiz

Quick Sort Algorithm Follows A Divide & Conquer Approach

• True

• False

What is one of the advantages of quick sort?

• It does in-place sort and doesnt use any extra storage memory

• It is efficient for small datasets

• It can be used to sort both integers and strings

• It has a worst-case time complexity of O(n^2)

Once a pivot has been chosen, all elements smaller than the pivot are placed to the right sub-array, while all elements bigger than the pivot are placed to the left sub-array.

• True

• False

What Is The Big O Notation For Quick Sort?

• O(n log n)

• O(n^2)

• O(log n)

• O(n)

Quick Sort Is Mainly Used In Operational Research & Event Driven-Simulation

• True

• False

Quick Sort Is Slower Compared To Merge Sort Or Heap Sort

• True

• False