Quicksort is an in-place sorting algorithm. Developed by British computer scientist Tony Hoare in 1959 and published in 1961, it is still a commonly used algorithm for sorting. When implemented well, it can be somewhat faster than merge sort and about two or three times faster than heapsort
15,10,20,18 -- 15,10,18,20 -- 10,15,18,20
15,20,10,18 -- 15,10,20,18 -- 10,15,20,18
10, 20,15,18 -- 10,15,20,18 -- 10,15,18,20
10, 20,15,18 -- 10,18,15,20 -- 10,15,18,20
Rate this question:
Exchanging
Partitioning
Selection
Merging
Rate this question:
True
False
Rate this question:
The list being divided into sublists with equal numbers of elements in each, then those sorted sublists are merged back together.
The list being divided into only two sublists, never more or less, which are sorted and merged back together.
The list being divided into smaller sublists, then those sorted sublists are merged back together.
Rate this question:
70
20
98
4
Rate this question:
Quiz Review Timeline +
Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.
Wait!
Here's an interesting quiz for you.