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'
(Of course) (one) (should use) (loops) instead!
Only wanted to show the positive effects of 'goto'. Most tutorials/books say it's the worst thing on earth to use 'goto' in C++ - programs. GOTO is by...
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...
There are algorithms, that can be implemented with 'goto' - and only with 'goto'!
'goto' is a basic jmp command your machine actually is able to understand (literally!).
This is why goto is...