Select sort and bubble sort

The first thing to start with is selection sorting ：

  Overall realization idea ：

  Complete code ：

void Swap(int* a, int* b)
{
	int t = *a;
	*a = *b;
	*b = t;
}
// Direct selection sorting 
void SelectSort(int* arr, int len)
{
	int begin = 0;
	int end = len - 1;
	while (begin < end)
	{
		int mini = begin;
		int maxi = begin;
		for (int i = begin + 1; i <= end; i++)
		{
			if (arr[i] < arr[mini])
			{
				mini = i;
			}
			if (arr[i] > arr[maxi])
			{
				maxi = i;
			}
		}
		// Find the subscript of the minimum and maximum 
		//  swapping 
		Swap(&arr[begin], &arr[mini]);
		if (begin ==maxi)
		{
			maxi = mini;
		}	
		Swap(&arr[end], &arr[maxi]);
		--end;
		++begin;
		
	}
}
void PrintSort(int* arr, int len)
{
	for (int i = 0; i < len; i++)
	{
		printf("%d ", arr[i]);
	}
}
int main()
{
	int arr[] = { 3,1,2,4,9,5,6};
	int len = sizeof(arr) / sizeof(arr[0]);
	SelectSort(arr, len);	
	PrintSort(arr, len);
}

Bubble sort ：
I believe you can learn C The first sort that language comes into contact with is bubble sort

Not much .

Then I'll put the code directly here ：

void Swap(int* a, int* b)
{
	int t = *a;
	*a = *b;
	*b = t;
}

// Bubble sort 
void BubbleSort(int* arr, int len)
{
	for (int i = 0; i < len-1; i++)
	{
		int flag = 0;
		for (int j = 1; j < len - i; j++)
		{
			if (arr[j - 1] < arr[j])
			{
				Swap(&arr[j - 1], &arr[j]);
				flag = 1;
			}
		}
		if (flag == 0)
		{
			break;
		}
	}

}
void PrintSort(int* arr, int len)
{
	for (int i = 0; i < len; i++)
	{
		printf("%d ", arr[i]);
	}
}
int main()
{
	int arr[] = { 3,1,2,4,9,5,6};
	int len = sizeof(arr) / sizeof(arr[0]);
	BubbleSort(arr, len);	
	PrintSort(arr, len);
}

If there is a mistake ！ Your smile ！