Introduction - If you have any usage issues, please Google them yourself
Bubble sort is one of the basic data algorithm, and its basic method is: to compare two adjacent elements, if necessary will carry out the exchange, each will complete a cycle at the end of the smallest elements (such as the smallest order ), the next cycle is a number of other similar operations? such as N by the smallest number of sorting, Turbo C language program function