C语言插入法排序和选择排序

• 插入法排序

void InsertSort(int* br, int n) //插入法排序
{
	assert(br != NULL);
	for (int i = 1; i < n; i++)
	{
		if (br[i - 1] > br[i])
		{
			int key = br[i];
			int j = i - 1;
			do
			{
				br[j + 1] = br[j];
				j--;
			} while (j >= 0 && br[j] > key);
			br[j + 1] = key;

		}
		
	}
}

• 选择排序

void SelectSort(int* br, int n)//选择排序
{
	assert(br != NULL);
	for (int i = 0; i < n - 1; i++)
	{      
		    
		for (int j = i+1; j < n; j++)
		{
			int minpos = i;
			if (br[minpos] > br[j])
			{
				minpos=j;
			}
			if(minpos!=i)
			Swap(&br[minpos], &br[i]);
		}
		  
	}

}