Linda PV
Reputation: 49
what method has O(log(n)) comparison
May I ask What sorting method that uses O(log(n)) comparison (eg: arrange items in unsorted arr2 into a sorted arr1 in a sorted order)?
Upvotes: 0
Views: 56
Answers (2)
Maurice Perry
Reputation: 9658
None.
Several algorithms are in O(n*log(n)) though: merge sort, heap sort, quick sort, etc...
Upvotes: 2
Related Questions
- Looking for a sort algorithm with as few as possible compare operations
- Which sorting algorithm uses the fewest comparisons?
- What sorting algorithm has Worst-Case time-complexity of O(n!)
- GNU sort - What is the default algorithm used for comparison?
- what is the algorithm that will give me O(logd)
- Which sorting algorithm should be used that runs in O(n)?
- Is there a sorting algorithm available which has time complexity of O(N)?
- Comparison of 'comparison' sorts
- Generic and practical sorting algorithm faster than O(n log n)?
- Comparison Sorting Algorithm Complexity