Question

Python Program to perform selection sort

Answer 1

Selection sort

It is an sorting algorithm in which the array is divided into sorted array and unsorted array and we need to find the minimum element from unsorted array  and put it in a sorted array sequence.

Algorithm: 

Set minimum element to index 0 Search the minimum element in the array Swap with value at minimum index  Increment minimum to point to next element Repeat until list is sorted

Example: 

a = [64, 25, 12, 22, 11] here we need to find the minimum element and place it in the beginning from i=0 to 4 11 25 12 22 64 here we need to find the minimum element and place it in the beginning from i=1 to 4 11 12 25 22 64 here we need to find the minimum element and place it in the beginning from i=2 to 4 11 12 22 25 64 here we need to find the minimum element and place it in the beginning from i=3 to 4 11 12 22 25 64

Program Code

def selsort(n):     for i in range(len(n)-1,0,-1):         max=0         for j in range(1,i+1):             if n[j]>n[max]:                 max = j             temp = n[i]             n[i] = n[max]             n[max] = temp n = [78,25,11,29,75,69,45,67] selsort(n) print("Sorted array : ",n)

Output

Sorted array : [11, 25, 29, 45, 67, 69, 75, 78]

---

For more RGPV/UTMP CSE V Sem Python Lab Experiments Click here

---