# Understanding selection sort for coding interviews

This is the first post in a series where we look at various sorting algorithms you’ll need to know for your next coding interview.

I struggled with understanding basic sorting algorithms when i first encountered them in college. I tried everything from re-reading lecture slides, watching recorded lectures, implementing the algorithms in code etc. But invariably after couple of days, I’d get the different algorithms mixed up.

Then one of our professors showed me a very simple technique to understand, remember and practice these sorting algorithms. The technique is deceptively simple – just take the unsorted array and write down the transformations to the array at each step when applying the sorting algorithm. And do it on a handwritten piece of paper – not in your mind, not in PowerPoint or Visio and definitely not in code before you have a thorough understanding. Finally, repeat the process every couple of days till this get’s in your head.

Selection Sort is too simple of an algorithm to show up in your next Microsoft or Google coding interview. However, we’re starting the series here so that you can get an quick introduction to the “paper-based” problem solving and visualization method before delving into more complicated sorts you might actually face on your next FAANG or Microsoft interview.

# Strategy for Selection Sort

Given an unsorted array of integers, we want to sort them in ascending order. The array under consideration is shown below:

Unsorted array to be sorted with selection sort

Here is the strategy:

- Select one element in the array, starting with the first element.
- Compare it to all other elements in the array sequentially.
- If an element is found to be smaller than the currently selected element, swap their positions.

Note that the correct position for the selected element is found before moving on to next element in the array.

# Visualize the algorithm on paper

This is the most critical part of understanding the algorithm. I’d suggest understanding the process of sorting as shown below and doing it yourself a few times till you can get the array to the correct sorted state.

Practice the algorithm on a piece of real paper or whiteboard ! You should try to write your own explanation at each step – this’ll help you reinforce and remember what you’re doing.

Selection Sort First Iteration

Above is the state of the array after the first iteration of the outer loop. 1 is indeed the smallest element in the array and should be in the first position. We are now done comparing the element in the first position in the array to every other element in the array.

Next we move to the second slot.

Selection Sort Second Iteration

We’re done with the second iteration. We can see that 2 is indeed the second smallest element and now the first two slots in this array are sorted.

Next move to the third slot and compare it’s element to every other element, swapping as necessary.

Selection Sort Third Iteration

The process continues till the entire array is sorted.

# Implementing Selection Sort in C#

using System; namespace Sorting { class SelectionSort { public static bool debug = false; public static void Sort(int[] inputArr) { for(int i=0; i < inputArr.Length; i++) { for(int j= i+1; j < inputArr.Length; j++) { if(inputArr[i] > inputArr[j]) { Utilities.Swap(inputArr, i, j); // Turn this flag on if you want to //understand the state of the array after each Swap if(debug) { Utilities.PrintArray(inputArr); } } } } } } }

# Analysis of Selection Sort

Sort Property | Analysis |
---|---|

Time Complexity | For each element, the entire list is checked to find the smallest element. So in the worst case, “n” elements are checked for each element. Hence the time complexity is O(N^2) |

Space Complexity | Since the array is sorted in place and no extra space is used, the space complexity is O(1) |

Adaptable | The order of elements does not affect the sorting time. In other words, even if the array is partially sorted, still each element is compared and there is no breaking out early. Hence Selection sort is non-adaptable. |

Stable | Selection sort is NOT a stable sorting algorithm. Elements which are equal might be re-arranged in the final sort order relative to one another. |

Number of Comparisons and Swaps | Selection Sort makes O(N^2) comparisons ( every element is compared to every other element).Selection Sort makes O(N) swaps to get all elements in the correct place. |

# When to use and when to avoid Selection Sort ?

**Use selection sort in the following scenarios:**

- When the array is NOT partially sorted
- When we have memory usage constraints
- When a simple sorting implementation is desired
- When the array to be sorted is relatively small

**Avoid using Selection sort when:**

- The array to be sorted has a large number of elements
- The array is nearly sorted
- You want a faster run time and memory is not a concern.