What do you think?
Rate this book
748 pages, Perfect Paperback
First published November 14, 1997
SelectionSort(A)
For i = 1 to n do
Sort[i] = Find-Minimum from A
Delete-Minimum from A
Return(Sort)
InsertionSort(A)
A[0] = -∞
for i = 1 to n - 1 do
j = i
while (A[j] > A[j-1]) do swap(A[j], A[j-1])
MergeSort(A[1, n])
Merge( MergeSort(A[1, [n/2]]), MergeSort(A[[n/2] + 1, n]))