Selection Sort
-
Selection SortAlgoDS/Algorithm 2020. 1. 22. 17:35
1. Overview The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from the unsorted part and putting it at the beginning. It's one of the Greedy Algorithms. 2. Description 2.1 Procedure The algorithm maintains two subarrays in a given array. In every iteration of selection sort, the minimum element (considering ascending order) from t..