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

Bubble Sort

It is the simplest type of sorting technique. In this sorting technique, first two elements are compared and if first element is greater than second, they are swapped. This process is repeated for each pair of adjacent elements to the end of the data set. It again starts with first two elements and repeat the process until no swap occurs.

This sorting technique can only be used for sorting small lists. This technique can also be used for the large lists if only few elements require sorting.

Important: Average and worst case performance of this sorting technique is O (n²).

Example: Consider the following unordered list 

5              10           3              1              9              0

First Pass

 5 <10 so there is no need of swapping.