w3resource
Python Exercises

Python Data Structures and Algorithms: Selection sort

Python Search and Sorting : Exercise-5 with Solution

Write a Python program to sort a list of elements using the selection sort algorithm.
Note : The selection sort improves on the bubble sort by making only one exchange for every pass through the list.

Pictorial Presentation : Selection Sort

Python: Selection Sort

Sample Solution:-

Python Code:

def selectionSort(nlist):
   for fillslot in range(len(nlist)-1,0,-1):
       maxpos=0
       for location in range(1,fillslot+1):
           if nlist[location]>nlist[maxpos]:
               maxpos = location

       temp = nlist[fillslot]
       nlist[fillslot] = nlist[maxpos]
       nlist[maxpos] = temp

nlist = [14,46,43,27,57,41,45,21,70]
selectionSort(nlist)
print(nlist)

Sample Output:

[14, 21, 27, 41, 43, 45, 46, 57, 70]

Flowchart:

Flowchart: Python Data Structures and Algorithms: Selection sort

Visualize Python code execution:

The following tool visualize what the computer is doing step-by-step as it executes the said program:

Python Code Editor :

Contribute your code and comments through Disqus.

Previous: Write a Python program to sort a list of elements using the bubble sort algorithm.
Next: Write a Python program to sort a list of elements using the insertion sort algorithm.

What is the difficulty level of this exercise?