Selection Sort

It is the sorting technique with O (n²) Complexity. Hence this technique can’t be used for sorting large lists. This sorting technique finds maximum Value from the list and swaps it with first element. This process is repeated for the remaining list until list is not sorted.

Only n swaps are required to swap n number of elements.

Example: Consider the following unordered list   

10

40

7

3

25

33

                                                               

First Pass: Highest element in the list is 40 swap it with first element

40

10

7

3

25

33

40 is now first