{"id":43,"date":"2022-03-30T04:56:53","date_gmt":"2022-03-30T04:56:53","guid":{"rendered":"http:\/\/www.programminginpython.com\/2023\/03\/30\/selection-sort-algorithm-in-python\/"},"modified":"2023-05-21T18:17:15","modified_gmt":"2023-05-21T18:17:15","slug":"selection-sort-algorithm-python","status":"publish","type":"post","link":"https:\/\/www.programminginpython.com\/selection-sort-algorithm-python\/","title":{"rendered":"Selection Sort Algorithm in Python"},"content":{"rendered":"

Hello everyone, welcome back to Programming In Python<\/a>! In continuation of the algorithm series here is one of the sorting algorithms. Here in this post, I will discuss on Selection Sort algorithm and how to implement Selection Sort in Python.<\/p>\n

In Selection Sort algorithm, the smallest element is searched and placed at the starting of the list by swapping the smallest element found with the first element of the list. So here, the list has 2 parts, one is sorted and the other is unsorted. Initially, the whole list is unsorted, but when each swapping occurs the leftmost part of the list becomes sorted and continues until the whole list is sorted.<\/p>\n

<\/div>\r\n\t\t\t