Bubble sorting and Related videos

#include <stdio.h>
void bubble_sort(int arr[], int sz)
{
	// Number of bubbling sortings 
	int i = 0;
	for (i = 0; i < sz-1; i++)
	{
		// Bubble sort 
		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;
			}
		}
	}
}
int main()
{
	int arr[10] = { 1,3,5,7,9,2,4,6,8,0 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	//0 1 2 3 4 5 6 7 8 9
	// To sort the array in ascending order 
	// Bubble sort 
	// When passing parameters to an array 
	// It's the array name 
	// Array name is essentially the address of the first element of the array 
	// When passing on the ginseng , What is passed is the address of the first element of the array 
	// Then the formal parameters of the array should be pointer variables to receive 
	// Degradation of array names 
	// The array name is the address of the first element （ There is 2 Exceptions ）
    // Two exceptions ：
   //1> sizeof( Array name ), The array name represents the entire array , It calculates the size of the entire array , The unit is byte 
   //2> & Array name , The array name represents the entire array , Take out the address of the entire array 
   // besides , The array name encountered is the address of the first element of the array 

	bubble_sort(arr, sz);
	// Print 
	int i = 0;
	for (i = 0; i < sz; i++)
	{
		printf("%d ", arr[i]);
	}

	return 0;
}

Specific and detailed videos ：： bubble sort _ Bili, Bili _bilibilihttps://www.bilibili.com/video/BV13J411L72U?spm_id_from=333.337.search-card.all.click&vd_source=74ebcf0e4be00bfb17ba0c2ffffba1de