SelectionSort

Selection Sort

Algorithm

selectionSort(array, n):
    for i = 1 -> n-1:
        min_index = i
        for j = i+1 -> n:
            if (array[j] < array[min_index]):
                min_index = j
    swap(array[i], array[min_index])

Complexity

• Time:
  • Worst Case:
  • Average Case:
  • Best Case:
• Space:
  • Worst Case: