bubblesort and selectionsort

来源:互联网 发布:网络摄像机ip搜索软件 编辑:程序博客网 时间:2024/06/05 16:33
#include<stdio.h>#define N 7int main(){void bubblesort(int);int a[N]={34,76,27,60,24,754,52};int i;for(i = 0; i < N; i++)printf("%d\t",a[i] );printf("\n");bubblesort(a);for(i = 0; i < N; i++)printf("%d\t",a[i] );printf("\n");getch();return 0;}void selectionsort(int *a){int i,j,k,temp;for(i = 0; i < N-1; i++){k = i;  //记录下标for(j = i+1; j < N; j++)if (a[k] > a[j])k = j;  //记录下标if (i != k){temp = a[k];a[k] = a[i];a[i] = temp;}}}/*void bubblesort(int *a)    //相邻比较,最大的在最后{int i,j,t;for(i = 0; i < N-1; i++){for(j = 0;j < N-1-i; j++){if(a[j] > a[j+1]){t = a[j+1];a[j+1] = a[j];a[j] = t;}}}}*/


原创粉丝点击