selection_sort.py

# The time complexity of this algorithm is O(n²)
defselection_sort(u_list: list):
new_list= []
# this function runs n times taking O(n) time
forkinrange(len(u_list)):
# Return the smallest item in the array
# This operation takes O(n) time
i=0
forjinrange(1, len(u_list)):
ifu_list[j] <u_list[i]:
i=j

new_list.append(u_list.pop(i))

returnnew_list


print(f'sorted list: {selection_sort([0, -1, 4, 3, 4, 10, 1])}')