29538 P1020069 (2)

INFORMATYKA WYKŁAD'6

Sortowanie Quicksort oraz bąbelkowe

ttinclude <stdio.h>

#include <stdlib.h>

#include <time.h>

#include <math.h> void quick(double *,int); void qs(double *,int,int); void sort (tnt, double []);

int main()

/

\

time_t start,end;

long unsigned t;

double s[50000],s 1 [50000]; -

unsigned long int n,i;

n=5000Ó;

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

s[i ]^r~rand()/(double)RANDJVlAX; for (i*0;i<n;i++)

si[i]=s[i]; startejmc(NU) ,L); quick(s,n); end^ti me(NULL);

prinlfC”Sortowanie Quicksort czas %fsckund.\n\n",difftimc(cnd,start));

printf("\n");

start- time(NUl ,L);

sort (n,sl);