Computer Science, asked by poornima2165, 1 month ago

algorithm for sorting

Answers

Answered by pooja14365
2

The best Algorithm for Sorting is Quicksort.

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.

PLEASE MARK IT AS BRAINLIEST

Similar questions