Bubble sort

thought ：

Traverse the array in turn to determine the largest number and put it in the last digit , A total of n Trip to , Make sure that the maximum number in each trip is placed at the end .

Code ：

void BubbleSort(int* arr, int len) {

    bool flag = true;// Used to determine whether to enter the exchange loop

    for (int i = 0; i < len; i++) {

        for (int j = 0; j < len - i; j++) {

            if (arr[j] > arr[j + 1]) {

                flag = false;

                int temp = arr[i];

                arr[i] = arr[j];

                arr[j] = temp;

            }

        }

        if (flag == true)// Not entering the cycle Prove that there is no exchange , It's an ordered sequence

            break;

    }}

int main()

{

    int arr[] = { 4,1,3,8 };

    BubbleSort(arr, sizeof(arr)/sizeof(arr[0]));

    return 0;

}