# Python Program - Selection Sort

Selection sort is based on the idea of finding smallest or largest element in unsorted array and placing it at the correct position in the sorted array. This will result into increasing the length of the sorted array by one and decreasing the length of unsorted array by one after each iteration.

### Example:

To understand the selection sort, lets consider an unsorted array *[1, 10, 23, -2]* and discuss each step taken to sort the array in ascending order. In every pass, smallest element is found in the unsorted array and swapped with first element of unsorted array.

** First Pass:** The whole array is unsorted array and

*(-2)*is the smallest number in the array. After finding

*(-2)*as smallest number, it is swapped with first element of the array.

** Second Pass:** In this example, the left hand side array is sorted array and length of this array increase by one after each iteration. After first pass length of the sorted array is one. Rest of the array is unsorted array.

*(1)*is the smallest number in the unsorted array which is swapped with first element of the unsorted array. After this swap, length of the sorted array and unsorted array will be two.

__Third Pass__:*(10)* is the smallest number in the unsorted array and swapped with the first element of the unsorted array.

__Fourth Pass__:*(23)* is the only number in the unsorted array and found to be at the correct position.

## Implementation of Selection Sort

# function for selection sort def selectionsort(MyList): for i in range(len(MyList)): min_idx = i for j in range(i+1, len(MyList)): if(MyList[j] < MyList[min_idx]): min_idx = j MyList[i], MyList[min_idx] = MyList[min_idx], MyList[i] # function to print list def PrintList(MyList): for i in MyList: print(i, end=" ") print("\n") # test the code MyList = [1, 10, 23, 50, 4, 9, -4] print("Original List") PrintList(MyList) selectionsort(MyList) print("Sorted List") PrintList(MyList)

The above code will give the following output:

Original List 1 10 23 50 4 9 -4 Sorted List -4 1 4 9 10 23 50

### Time Complexity:

The time complexity of selection sort is *Θ(N²)* in all cases even if the whole array is sorted because the entire array need to be iterated for every element and it contains two nested loops.

### Recommended Pages

- Python - Swap two numbers
- Python Program - Fibonacci Sequence
- Python Program - Insertion Sort
- Python Program - Find Factorial of a Number
- Python Program - Find HCF of Two Numbers
- Python Program - Merge Sort
- Python Program - Shell Sort
- Stack in Python
- Queue in Python
- Python Program - Find LCM of Two Numbers
- Python Program - To Check Whether a Number is Palindrome or Not
- Python Program - To Check Whether a String is Palindrome or Not
- Python Program - Heap Sort
- Python Program - Quick Sort
- Python - Swap Two Numbers without using Temporary Variable
- Python Program - To Check Armstrong Number
- Python Program - Counting Sort
- Python Program - Radix Sort
- Python Program - Find Largest Number among Three Numbers
- Python Program - Print Floyd's Triangle