版权声明:本文是博主原创文章,未经许可,不得转载本文任何内容。原文地址: https://blog.csdn.net/smile_Running/article/details/82228355
一、冒泡排序:
#include "stdio.h"
main()
{
int array[22] = {5,6,4,9,7,63,4,65,32,45,76,13,45,56,33,79,1,65,4,3,9,85};
int i,j,k,temp;
for( i=0; i<22; i++)
printf("%d ",array[i]);
printf("\n",array[i]);
for(j=0; j<22; j++)
for(k=0; k<22-j; k++)
if(array[k]>array[k+1])
{
temp=array[k];
array[k] = array[k+1];
array[k+1] = temp;
}
for(i=0; i<22; i++)
printf("%d ",array[i]);
printf("\n",array[i]);
}
©原文链接:https://blog.csdn.net/smile_Running/article/details/82228355