P1:{
Merge Sort:
O(n*log(n)) ALWAYS - GUARANTEED
}
vs.
P2:{
Quick Sort:
O(n*log(n)) ALMOST - IN ITS 'BEST CASE'
Type: Posts; User: sehr alt
P1:{
Merge Sort:
O(n*log(n)) ALWAYS - GUARANTEED
}
vs.
P2:{
Quick Sort:
O(n*log(n)) ALMOST - IN ITS 'BEST CASE'
I read an article at wikipedia which said that Quicksort can never sort as quickly as Merge Sort!? In its worst case Quicksort's O-complexity is O(nē), whereas Merge Sort will never have any other...