Bubble sort and select sort

Http://www.runoob.com/w3cnote/sort-algorithm-summary.html Summary

Reading "Introduction to Computer Science" third edition

The difference in Baidu know to find:

The difference is that the bubbling algorithm, each time a comparison is found in the back of the smaller elements, the exchange of two adjacent elements. and the choice of sorting algorithm improvement is: first not in a hurry to change position, first from a[1] start one by one, to see which number is the smallest to write down the position of the number of P, and so a lie scan completed, and then A[p] and a[1] swapped, then a[1] to a[10] the smallest data in the top position.

So, choosing to sort the array once per scan, requires only a real exchange, and bubbling may take many times. The number of comparisons is the same.

Bubble sort and select sort