Sort And Searching Question: Download Sort And Searching PDF
Explain quick sort?
Answer:
Quick sort is one the fastest sorting algorithm used for sorting a list. A pivot point is chosen. Remaining elements are portioned or divided such that elements less than the pivot point are in left and those greater than the pivot are on the right. Now, the elements on the left and right can be recursively sorted by repeating the algorithm.
| Previous Question | Next Question |
| What is bubble sort algorithm in data structure sort and searching? | What is Linear-logarithm chasm? |