|
Related articles:
Bubble sort
Insertion sort
Sorting algorithm
Cocktail sort
Comparison sort
In-place algorithm
Heapsort
Big O notation
Key terms: sort math selection sort element algorithm max value if array swap items insertion ipos find list insertion sort minimum data structure do comparisons sorting algorithms position order writes data structure remaining scans pre lowest already pass bingo next source memory begin variant k requires searching edition pascal fewer log efficient advantage far heap remainder perform number of writes first position loop Search external links cited by footnotes on Wikipedia page Selection sort: |
|