c语言字符串排序blue,求几个C语言的程序 顺序查找，排序（升序和降序），冒泡排序，选择排序，直接插入排序和二分插入排序。...

3.冒泡排序

#include

main()

{

int i,j,temp;

int a[10];

for(i=0;i<10;i++)

scanf ("%d,",&a[i]);

for(j=0;j<=9;j++)

{ for (i=0;i<10-j;i++)

if (a[i]>a[i+1])

{ temp=a[i];

a[i]=a[i+1];

a[i+1]=temp;}

}

for(i=1;i<11;i++)

printf("],",a[i] );

printf("\n");

}

4.选择排序

#include

void selectSort(int a[],int n)

{int t,i,j,k;

for(i=0;i

{k=i;

for(j=i+1;j

if(a[j]

k=j;

t=a[i];

a[i]=a[k];

a[k]=t;

}

}

main()

{int a[100],n,i;

scanf("%d",&n);

puts("Arrange:");

for(i=0;i

scanf("%d",&a[i]);

selectSort(a,n);

puts("Sorted Arrange:");

for(i=0;i

printf("%d\t",a[i]);

getch();

}

5.直接插入排序

#include "stdio.h"

#include "conio.h"

main()

{

int a[11]={1,4,6,9,13,16,19,28,40,100};

int temp1,temp2,number,end,i,j;

printf("original array is:\n");

for(i=0;i<10;i++)

printf("]",a[i]);

printf("\n");

printf("insert a new number:");

scanf("%d",&number);

end=a[9];

if(number>end)

a[10]=number;

else

{

for(i=0;i<10;i++)

{

if(a[i]>number)

{

temp1=a[i];

a[i]=number;

for(j=i+1;j<11;j++)

{

temp2=a[j];

a[j]=temp1;

temp1=temp2;

}

break;

}

}

}

for(i=0;i<11;i++)

printf("m",a[i]);

getch();

}

6.二分法查找

int binarysearch(int a[],int x,int n)

{

int left,right,middle;

left=0;

right=n-1;

while(left<=right)

{

middle=(left+right)/2;

if(x==a[middle])

return middle;

if(x>a[middle])

left=middle+1;

else right=middle-1;

}

return -1;

}