实验7-1-1-一维数组 简化的插入排序

#include<stdio.h>
void bubble_sort(int arr[], int n)
{

	int a = 0;
	for (a = 0; a < n ; a++)
	{
		int j = 0;
		for (j = 0; j < n - a ; j++)
		{
			if (arr[j] > arr[j + 1])
			{
				int tmp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = tmp;
			}
		}
	}
}
int main()
{
	int arr1[20] = {  };
	int arr2[20] = {  };
	int n = 0; scanf("%d", &n);
	int i = 0; 
	for (i = 0; i < n; i++)
	{
		scanf("%d", &arr1[i]);
		arr2[i] = arr1[i];
	}
	bubble_sort(arr1, n);
	for (i = 0; i < n; i++)
	{
		if (arr2[i] == arr1[n - 1])
		{
			printf("%d %d", arr2[i],i);
			break;
		}
	}
	return 0;
}