算法·杂烩

来源：互联网发布：vscode配置go 编辑：程序博客网时间：2024/05/01 11:50

一、冒泡

#include <stdio.h>   #define N   10   main()   {       int i, j, temp;       int a[N];       printf("please input %d numbers:\n",N);       for(i = 0; i < N; i++)       {            scanf("%d",&a[i]);       }              for (i = 0; i < N-1; i++)       //表示要比较N-1趟       {           for (j =0; j < N-i-1; j++)  //表示每趟比较的次数           {               if (a[j] > a[j+1])               {                   temp = a[j];                   a[j] = a[j+1];                   a[j+1] = temp;               }           }          }          for(i = 0; i < N; i++)       {           printf("%-5d",a[i]);       }       printf("\n");          }

二、快速

#include <stdio.h>int partions(int l[],int low,int high){int prvotkey=l[low];l[0]=l[low];while (low<high){     while (low<high&&l[high]>=prvotkey)     --high;     l[low]=l[high];     while (low<high&&l[low]<=prvotkey)      ++low;     l[high]=l[low];}l[low]=l[0];return low;}void qsort(int l[],int low,int high){int prvotloc;if(low<high){     prvotloc=partions(l,low,high);    //将第一次排序的结果作为枢轴     qsort(l,low,prvotloc-1); //递归调用排序 由low 到prvotloc-1     qsort(l,prvotloc+1,high); //递归调用排序 由 prvotloc+1到 high}}void quicksort(int l[],int n){qsort(l,1,n); //第一个作为枢轴 ，从第一个排到第n个}void main(){int a[11]={0,2,32,43,23,45,36,57,14,27,39};for (int b=1;b<11;b++)printf("%3d",a[b]);printf("\n");quicksort(a,11);for(int c=1;c<11;c++)printf("%3d",a[c]);}