How it works:

Selection Sort divides the input list into two parts: a sorted portion and an unsorted portion. It repeatedly finds the minimum element from the unsorted portion and places it at the beginning. This process continues until the entire list is sorted.

• Time Complexity : O(n²)
• Space Complexity : O(1)
• Best Case : O(n²)