@.PYTHON PROGRAMMING - SELECTION SORT

Easy way to learn data structures and algorithm programming in simple and easy steps using Python as a programming language.
Also includes the Syllabus of Classes XIth & XIIth.
---------------------------------------------------------------------------------------------------------------------------------------------------
he selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array.

1) The subarray which is already sorted.
2) Remaining subarray which is unsorted.

In every iteration of selection sort, the minimum element (considering ascending order) from the unsorted subarray is picked and moved to the sorted subarray.
let's see how it works in action with a list that contains the following elements: [3, 5, 1, 2, 4].

We begin with the unsorted list:

3 5 1 2 4

The unsorted section has all the elements. We look through each item and determine that 1 is the smallest element. So, we swap 1 with 3:

1 5 3 2 4

Of the remaining unsorted elements, [5, 3, 2, 4], 2 is the lowest number. We now swap 2 with 5:

1 2 3 5 4

This process continues until the list is sorted:

LINK RELATED PROGRAMS :https://github.com/saritaverma60/python-program
LINK FOR COMPLETE PLAYLIST :https://www.youtube.com/watch?v=Sz6hjDv82wc&list=PLNY8CSQ-shJO6PTVBk1U0pdMJAybDtcoP
FACEBOOK LINK: https://www.facebook.com/Kundan-Tutorial-1927301307292166/?modal=admin_todo_tour

#Kundantutorial #selectionsor #sortingalgorithm