Selection Sort Algorithm Analysis

Analyze Selection Sort using Big O Asymptotics Line by Line!

Note: The code I use in this article is slightly different

OVERVIEW

Selection sort is a sorting algorithm in computer science. It has O(n²) time complexity. O(n²) isn’t a good time complexity for sorting lists when it comes to large input sizes. This algorithm sorts an array or list by repeatedly finding the minimum value (if we are sorting in ascending order) from the…