algorithms-python/algorithms/sort/selection_sort.py at master · Mu-L/algorithms-python · GitHub

23 lines (18 loc) · 609 Bytes

def selection_sort(arr, simulation=False):

""" Selection Sort

Complexity: O(n^2)

"""

iteration = 0

if simulation:

print("iteration",iteration,":",*arr)

for i in range(len(arr)):

minimum = i

for j in range(i + 1, len(arr)):

# "Select" the correct value

if arr[j] < arr[minimum]:

minimum = j

arr[minimum], arr[i] = arr[i], arr[minimum]

if simulation:

iteration = iteration + 1

print("iteration",iteration,":",*arr)

return arr

Expand file tree