Bubble Sort Algorithm
Take the first pair i.e. first and second items.Swap them if they are out of order.Take the next pair (second and third and so on) and repeat step 2.Once you reach the end, do another pass.
Do as many passes as needed to get all the items in order.
• Completion time grows in quadratic proportion to the size of the data set i.e. Order of Growth is $\mathcal{O}_{n^2}$.
• As this is the slowest sort algorithm, it is never used (except in the classroom to introduce the concept).
• Read more at "Bubble sort" Wikipedia.