#include<stdio.h>
void f(int *p,int n);
int main()
{
int a[10] = { 10, 3, 5, 7, 2, 9, 8, 1, 4, 6};
f(a);
int i;
for(i=0;i<a;i++)
printf("%d ",n[a]);
}
-
选择排序
void f(int *p,int n)
{
int i,j;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++){
int k;
if(p[i] > p[j]){
k = p[i];
p[i] = p[j];
p[j] = k;
}
}
}
-
冒泡排序
void f(int *p,int n)
{
int i,j;
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++){
if(p[j] > p[j+1]){
int k;
k = p[j];
p[j] = p[j+1];
p[j+1] = k;
}
}
}