一天學一個排序算法，第一天先寫學過的冒泡排序
冒泡排序 2018\07\29
//冒泡排序
//by Gallien
#include <stdio.h>
#define Max_maopao 10
void maopao(int a[],int n);
int main(void)
{
int a[Max_maopao];
int i,n;
printf("Enter the number of your numbers:\n");
scanf("%d",&n);
printf("Please enter the numbers who need to be sorted:\n" );
for (i = 0;i < n;i++)
scanf("%d",&a[i]);
printf("The numbers before being sorted:\n");
for (i = 0;i < n;i++)
printf("%d ",a[i]);
maopao(a,n);
printf("\nThe numbers after being sorted:\n");
for (i = 0;i < n;i++)
printf("%d ",a[i]);
return 0 ;
}
void maopao(int a[],int n)
{
int i,j,exchange;
for(i = 0;i < n;i++)
for(j = 0;j < n-i;j++)
if(a[j]>a[j+1])
{
exchange = a[j];
a[j] = a[j+1];
a[j+1] = exchange;
}
}
8.12 過去好多天了谈撒，啥也沒看腥泥，慚愧
