Fig. Straight Insertion

0	1	2		j	
Schemating Sorting Description

…		i	…	n	
x										
.
.
.
.

Find the smallest between the [i…n].	
Put it in a[0];
Repetitive move till I-th location

.
.
.
.
.
.
.
.
.
.
.
.

Straight Selection

1	2	3	…	i										n	
				 ^
                                                  |

find the smallest one between [i,n]
and putting it in the i'th location.	

Straight Exchange - Bubble-sort
The exchange is performed when a[j-1]>a[j].

	-	1	
	-	2	
	-	3	
	-	…	
i	-	8	
	-		
	-		
	-		
	-		
	-		
	-		
n	-		

Shake-sort is a kind of Bubble-Sort, changing its directions: top-down, bottom-up and vice-versa.

Partition:
1					i									j					n	

					  							    ^
 						     |					
 < X <

Quick Sort	(Recursive partition).