Question: Given the algorithm below for SelectionSort, trace the function by specifying the state of the input sequence after each call to swap()
Part a: In the selection sort algorithm below, how often is the comparison (s j < sindex ) executed for the input given?
Part b: Give a formula in terms of n for the number of comparisons in the selection sort algorithm.
Can someone give the algorithm that implement selection sort algorithm?