Which is the fastest sorting algorithm?
Answers
Answered by
0
The time complexity of Quicksort is O(n log n) in the best case, O(n log n) in the average case, and O(n^2) in the worst case. But because it has the best performance in the average case for most inputs, Quicksort is generally considered the “fastest” sorting algorithm.
atd01:
Can you explain?
hey u have ask any questions which was deleted
then i told u to go fo log out
any more problem
no thanks dear
fine
Similar questions