Bubble sort in C language

Bubble Sort

#include<stdio.h>

int main()
{
    
    
	int a[10];
	int i,j,k;
	for(i = 0;i < 10;i++)
	{
    
    
		scanf("%d",&a[i]);//数组名代表数组首地址,注意与a[0]的区别,a[0]代表的是值,不是地址
	}
	
	for(i = 0;i < 10;i++)
	{
    
    
		for(j = 0;j < 10 - i - 1;j++)
		{
    
    
			if(a[j] > a[j + 1])
			{
    
    
				k = a[j];
				a[j] = a[j + 1];
				a[j + 1] = k;
			}
			
		}
		//printf("%d ",a[i]);
	}


	for(i = 0;i < 10;i++)
	{
    
    
		printf("%d ",a[i]);
	}
	printf("\n");
}

Guess you like

Origin blog.csdn.net/weiwei_lol/article/details/109272630