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.

Questo esercizio fa parte del corso

Data Structures and Algorithms in Python

Visualizza il corso

Istruzioni dell'esercizio

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.

Esercizio pratico interattivo

Prova a risolvere questo esercizio completando il codice di esempio.

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)

Modifica ed esegui il codice