C ile insertion sort

26 Ocak 2009 – 15:41

#include<stdio.h>
#include <stdlib.h>
#include <time.h>

int main(){
int *dizi;
   int N,i,j,z,xa,fklittle,y;
   time_t start,end;
   double dif;
   dizi=(int *)malloc(sizeof (int));
   printf(”N=”);
   scanf(”%d”,&N);
   
   time(&start);
   
srand(time(NULL));
for(i=0;i<N;i++){
int fktherandom = rand();
dizi=fktherandom;
printf(”dizi[%d]=%d\t”,i,dizi);
}
for(j=0;j<N;j++){
fklittle=dizi[N];
xa=N;
for(y=j;y<N;y++)
if(dizi[y]<fklittle){
fklittle=dizi[y];
xa=y;
}
dizi[xa]=dizi[j];
dizi[j]=fklittle;
}

for(z=0;z<N;z++)
printf(”\ndizi[%d]=%d”,z,dizi[z]);

time(&end);
   dif=difftime(end,start);
   printf(”\n\n\n%21f\n\n\n”,dif);

return 0;

}