How does selection sort work

Actually, we don't support password-based login. Never have. Just the OAuth methods above. Interview Cake. Toggle navigation Interview Cake.

Interview Tips First coding interview? Start here. Sorting Algorithm. Strengths: Intuitive. Ever packed a suitcase, putting in large items before smaller ones? That's selection sort! Space efficient. Selection sort only requires a constant amount of additional space. Weaknesses: Slow. Selection sort takes time, even if the input is already sorted. That's too slow to be used on super-big data sets. How It Works Selection sort works by selecting the smallest element from an unsorted array and moving it to the front.

Implementation Here's how we'd code it up:. The first position where 14 is stored presently, we search the whole list and find that 10 is the lowest value.

So we replace 14 with After one iteration 10, which happens to be the minimum value in the list, appears in the first position of the sorted list. For the second position, where 33 is residing, we start scanning the rest of the list in a linear manner. We find that 14 is the second lowest value in the list and it should appear at the second place.

We swap these values. Find the minimum element in remaining. Swap the found minimum element with. WriteLine ;. WriteLine "Sorted array" ;. Output: Sorted array: 11 12 22 25 Previous Time Complexities of all Sorting Algorithms. Next Program to check if a given number is Lucky all digits are different. Recommended Articles. Sort all even numbers in ascending order and then sort all odd numbers in descending order. Article Contributed By :. Easy Normal Medium Hard Expert. Writing code in comment?

Please use ide.