Bubble sort idea and Implementation

1、 What is bubble sorting

The core idea of bubble sorting ： Compare two adjacent elements
A set of data 【9 8 7 6 5 4 3 2 1 0】, Arrange them as 【0 1 2 3 4 5 6 7 8 9】.

A bubble sort brings a data to where it should eventually appear .

1. 10 Data needs to be 9 Bubble sort ,n Data needs to be n-1 Bubble sort .
2. 10 When performing the first bubble sort of data , Compare the data in pairs , Need to compare 9 Time . The second time , Need to compare 8 Time .n Data , The first bubble sort needs to be compared n-1 Time , The second trip needs to compare n-2 Time ……

2、 Arrange the data by bubble sorting

#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
void bubble_sort(int arr[], int sz)
{
     
	int i = 0;
	for (i = 0; i < sz - 1; i++)
	{
     
		int flag = 1;  // Suppose the array is ordered 
		int j = 0;
		for (j = 0; j < sz - 1 - i; j++)
		{
     
			if (arr[j] > arr[j + 1])
			{
     
				int tmp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = tmp;
				flag = 0;
			}
		}
		if (flag == 1)
		{
     
			break;  // It shows that it is really orderly , Stop the cycle , Stop sorting , Save time 
		}
	}
}

int main()
{
     
	int arr[] = {
      9,8,7,6,5,4,3,2,1,0 };
	int i = 0;
	int sz = sizeof(arr) / sizeof(arr[0]);
	bubble_sort(arr, sz);
	for (i = 0; i < sz; i++)
	{
     
		printf("%d ", arr[i]);
	}
	return 0;
}

Print the results