3 ms·
Points deducted for incorrect O's. Quick Sort is not O(n log n), and merge sort is not O(n^2)
by xpda 12y ago
Points deducted for incorrect O's. Quick Sort is not O(n log n), and merge sort is not O(n^2)
- clintonc 12y agoWell, Quick Sort is O(n log n) on average, but you know that. Also, anything that's O(n log n) is also O(n^2), which means that the author is the worst kind of correct -- but you knew that too :)