Coding selection sort

In the last video, you studied the selection sort algorithm.

In this exercise, you will need to implement it by completing the selection_sort() function.

This exercise is part of the course

Data Structures and Algorithms in Python

View Course

Exercise instructions

Set lowest to the element of the list located at index i.
Iterate again over the list starting on the next position of the i variable.
Compare whether the element of the list located at index j is smaller than lowest.

Hands-on interactive exercise

Have a go at this exercise by completing this sample code.

def selection_sort(my_list):
  list_length = len(my_list)
  for i in range(list_length - 1):
    # Set lowest to the element of the list located at index i
    lowest = ____
    index = i
    # Iterate again over the list starting on the next position of the i variable
    ____ j in range(____, list_length):
      # Compare whether the element of the list located at index j is smaller than lowest
      if _____:
        index = j
        lowest = my_list[j]
    my_list[i] , my_list[index] = my_list[index] , my_list[i]
  return my_list

my_list = [6, 2, 9, 7, 4, 8] 
selection_sort(my_list)
print(my_list)

Edit and Run Code