Algorithm Design Questions Medium
The time complexity of the selection sort algorithm is O(n^2), where n is the number of elements in the array to be sorted. This means that the time it takes to sort the array increases quadratically with the number of elements.