三天不练手生,真是这样!下面是代码:
#include
#include
void my_swap(int* a,int* b)
{
int tmp=*a;
*a=*b;
*b=tmp;
}
int my_find(int a[],int length,int target)
{
int i=0;
//defense programming
if(length<=0)
return -1;
while(i
if(a[i]>target)
return i;
i++;
}
return -1;//not found
}
void my_sort(int a[],int length)
{
int i=0,index=0;
if(length<=1) return;
while(i
if(a[i]
index=i;
}
i++;
}
my_swap(a,a+index);
my_sort(a+1,length-1);
}
int p(int n)
{
int i,j,index;//index points to the end of the space