[Algorithm practice every day] bubble sort

/** Bubble Sort * Core Original: Each comparison of two adjacent elements, if their order does not meet the requirements to exchange them *               each trip can only determine a number of               the time complexity of the algorithm is O (n*n), in addition to the name a little meaning, really inefficient */void　　Bubblesort (int array[], int length) {int tmp;  for (i=0; i<length-1; i++) {for (j=0; j<length-i-1; j + +)//Here is the core of bubbling, manual drawing at a glance {if (array[j]>array[j+1])　　　　　　　　Adjust the greater than sign, less than the number can be adjusted from large to small, small to large order {tmp = A[j];　　　　　　　　A[J] = a[j+1]; 　　　　　　A[J+1] = tmp; }　　　　}　　}}

　　

[Algorithm practice every day] bubble sort