7-27 bubble sorting (the k-th time)

take N Bubble sorting of integers from small to large works like this ： Compare two adjacent elements from beginning to end , If the preceding element is greater than the following element , Then exchange them . Through a scan , Then the last element must be the largest element . And then do the same thing with the front N−1 Elements for a second scan . And so on , In the end, you only need to deal with two elements , It's done right N The order of numbers .

For any given K（<N）, Output scan end K The middle result sequence after the pass .

Input format ：

Enter in 1 It is given in the line N and K（1≤K<N≤100）, In the 2 It is given in the line N Integers to sort , Numbers are separated by spaces .

Output format ：

Output bubble sort in one line, scan the end of K The middle result sequence after the pass , Numbers are separated by spaces , But there must be no extra space at the end .

sample input ：

6 2
2 3 5 1 6 4

sample output ：

2 1 3 4 5 6

Code ： 

#include<stdio.h>
int main()
{
	int K,N;
	int i=0,j=0,max;
	int a[100];
	scanf("%d %d",&N,&K);
	for(i=0;i<N;i++)
	{
		scanf("%d",&a[i]);
	}
	for(i=1;i<=K;i++)
	{
		for(j=0;j<N-i;j++) // Each trip has one count to the final position, so it is a comparison N-i
		{
			if(a[j]>a[j+1])
			{
				max=a[j];
				a[j]=a[j+1];
				a[j+1]=max;
			}
		}
	}
	for(i=0;i<N;i++)
	{
		printf("%d",a[i]);
		if(i!=N-1)
		printf(" ");
	}
	return 0;
}