1)What is Selection Sort ?
Selection sort is a simple sorting algorithm. This sorting algorithm is an in-place comparison-based algorithm in which the list is divided into two parts, the sorted part at the left end and the unsorted part at the right end. Initially, the sorted part is empty and the unsorted part is the entire list.
The smallest element is selected from the unsorted array and swapped with the leftmost element, and that element becomes a part of the sorted array. This process continues moving unsorted array boundary by one element to the right.
2)What is the complexity of Selection Sort ?
Time Complexity of average and worst case are of Ο(n^2) where n is the number of items.
3)Why it is called Selection Sort ?
In every iteration of selection sort, the minimum element (considering ascending order) from the unsorted subarray is picked/select and moved to the sorted subarray.
4)What are the pros and cons of Selection Sort algorithm?
Pros:
It never makes more than O(n) swaps and can be useful when memory write is a costly operation.
Cons:
This algorithm is not suitable for large data sets as its average and worst case complexities are of Ο(n2), where n is the number of items.