Sort-bubble sort

Most of the Internet School Students' written examinations will have questions about algorithms and data institutions. In order to prepare for the written examination, they will start learning algorithms and data structures.

This article is the basic Bubble sorting. c ++ is used for this series of learning.

Bubble Sorting language description:

Assume that incremental sorting is required. Select the first element, traverse the following elements and compare them with them. If the value is greater than, the two positions are exchanged. Repeat the above process until the last element.

The Code is as follows:

Bool bubblesort (int * array) {int temp; For (INT I = 0; I <length (array); I ++) {for (Int J = I + 1; j <length (array); j ++) {If (array [I]> array [J]) {temp = array [I]; array [I] = array [J]; array [J] = temp ;}} return true ;}

 

Sort-bubble sort