Please enable JavaScript.
Coggle requires JavaScript to display documents.
Quick Sort, Heap Sort - Coggle Diagram
Quick Sort
-
-
-
-
-
for priority queues
Priority tail with quicksort, does it work? It won’t work for this case to to n^2 complexity.
Example: why it does not work using quicksort?
In the bank, right in that moment, it will be called.
No va a esperar el tiempo de los n primeros.
-
the values in an array A are distinct at the cost of O (n). Converts each input value A[i] to an ordered pair (A[i], i) with (A[i], i) < (A[j], j)
if A[i] < A[j] or if A[i] = A[j] and i < j
-
-
Heap Sort
Differences vary so much
depending on where we apply.
Keep in mind in which conditions the algorithm
will execute.
