bubble sort algorithm in c++ || Bubble sort explained || sinking sort

 Bubble sort-

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The pass of the list is repeated until the list is sorted.

Why bubble sort is called “bubble” sort? The “bubble” sort is called so because the list elements with greater value than their surrounding elements “bubble” towards the end of the list. For example, after first pass, the largest element is bubbled towards the right most position.

Worst complexity: n^2

Average complexity: n^2

Best complexity: n

Space complexity: 1

at the end of i th pass, we have the i th largest element placed at its correct place.

look the example below.

Example: 
First Pass: 

( 5 1 4 2 8 ) –> ( 1 5 4 2 8 )

( 1 5 4 2 8 ) –>  ( 1 4 5 2 8 )

( 1 4 5 2 8 ) –>  ( 1 4 2 5 8 )

( 1 4 2 5 8 ) –> ( 1 4 2 5 8 )

1st largest placed at the correct place.

Second Pass: 

( 1 4 2 5 8 ) –> ( 1 4 2 5 8 ) 
( 1 4 2 5 8 ) –> ( 1 2 4 5 8 )
( 1 2 4 5 8 ) –> ( 1 2 4 5 8 ) 
( 1 2 4 5 8 ) –>  ( 1 2 4 5 8 )

second largest placed at correct place.

Third Pass: 
( 1 2 4 5 8 ) –> ( 1 2 4 5 8 ) 
( 1 2 4 5 8 ) –> ( 1 2 4 5 8 ) 
( 1 2 4 5 8 ) –> ( 1 2 4 5 8 ) 
( 1 2 4 5 8 ) –> ( 1 2 4 5 8 ) 

third largest placed at correct place.

and so on.

code for your referance.