| Selection
Sort |
|
|
|
|
|
|
|
|
|
| procedure
SelectionSort (Array[1..N] |
||||||||
| For
i=1 to N-1 |
||||||||
| Find the smallest entry in Array[i..N] |
||||||||
| Let j
be the index of that entry |
||||||||
| Swap(Array[i],Array[j]) |
||||||||
| End For |
||||||||
| While
other people are coding QuickSort/MergeSort |
||||||||
| Twiddle thumbs |
||||||||
| End
While |
||||||||
