/* Program to test function countSetBits */
int main()
{
int n,i,j=1,res,k=0;
scanf("%d",&n);
for(i=1;i<n;i++){
j=2*j;
if(n<j)
{k=i+1;
break;
}
else if(n==j)
{k=i+2;
break;
}
}
int arr[n][2];
for(i=0;i<n;i++)
{
res=countSetBits(i+1);
arr[i][1]=i+1;
arr[i][0]=res;
}
bucketsort(arr,k);
return 0;
}
int main(int argc, char **argv)
{
if (!argc)
return 0;
bucketsort((void **) argv, argc);
int i;
for (i = 0; i < argc; i++) {
printf("%s\n", argv[i]);
};
};
int main (){
int n,i,j ;
clock_t start_x,end_x,total_x;
printf("enter the number of elements \n");
scanf("%d",&n);int a[100],b[10][100];
printf("\nenter the number of elements\n");
for(i=0;i<n;i++){
printf("Enter the %d element: ",i+1);
scanf("%d",&a[i]);
}
bucketsort(a,n,b);
printf("Sorted list is: ");
for(i=0;i<n;i++){
printf("%d ",a[i]);
}
}
/*
* Runs benchmark.
*/
int main(int argc, char **argv)
{
int i; /* Loop index. */
int *a; /* Array to be sorted. */
uint64_t end; /* End time. */
uint64_t start; /* Start time. */
readargs(argc, argv);
timer_init();
srandnum(seed);
/* Benchmark initialization. */
if (verbose)
printf("initializing...\n");
start = timer_get();
a = smalloc(p->n*sizeof(int));
for (i = 0; i < p->n; i++)
a[i] = randnum() & 0xfffff;
end = timer_get();
if (verbose)
printf(" time spent: %f\n", timer_diff(start, end)*MICROSEC);
/* Cluster data. */
if (verbose)
printf("sorting...\n");
start = timer_get();
bucketsort(a, p->n);
end = timer_get();
total = timer_diff(start, end);
/* Print timing statistics. */
printf("timing statistics:\n");
printf(" master: %f\n", master*MICROSEC);
for (i = 0; i < nclusters; i++)
printf(" slave %d: %f\n", i, slave[i]*MICROSEC);
printf(" communication: %f\n", communication*MICROSEC);
printf(" total time: %f\n", total*MICROSEC);
/* House keeping. */
free(a);
return (0);
}
int main()
{
int n = 1000;
input = fopen("names1000.txt", "r");
output = fopen("output.txt", "w");
person mas[1000];
read(mas);
std::clock_t start_time = std::clock();
//bubblesort(mas,n);
bucketsort(mas, n);
std::clock_t end_time = std::clock();
double duration = (end_time - start_time) / double(CLOCKS_PER_SEC);
fprintf(output, "%f\n", duration);
write(mas,n);
}
int main(int argc, char **argv)
{
if (argc < 2)
EXIT("number?");
long i, n = atoi(argv[1]);
long *numbers = (long *) malloc(n * sizeof(long));
if (!numbers)
EXIT("malloc failed");
srandom(time(NULL));
for (i = 0; i < n; i++)
numbers[i] = random();
printf("# before\n");
for (i = 0; i < n; i++)
printf("%ld\n", numbers[i]);
printf("# after\n");
bucketsort((void **) numbers, n, asis, radix, cmp);
for (i = 0; i < n; i++)
printf("%ld\n", numbers[i]);
free(numbers);
return 0;
};
int main(int argc, char **argv)
{
if (argc < 2)
EXIT("no file");
FILE *fp = fopen(argv[1], "r");
if (!fp)
EXIT(argv[1]);
char buf[LINESIZE];
size_t lcur, llen = LINESIZE;
char **lines = (char **) malloc(llen * sizeof(char *));
if (!lines)
EXIT("malloc failed");
for (lcur = 0; fgets(buf, LINESIZE, fp); lcur++) {
if (lcur == llen) {
llen <<= 1;
// fprintf(stderr, "realloc %d bytes\n", llen * sizeof(char *));
lines = realloc(lines, llen * sizeof(char *));
if (!lines)
EXIT("malloc failed");
}
int slen = strlen(buf);
if (slen > 0 && buf[slen - 1] == '\n')
buf[slen - 1] = '\0'; // do not copy \n
lines[lcur] = strdup(buf);
if (!lines[lcur])
EXIT("malloc failed");
}
size_t i;
// for (i = 0; i < lcur; i++) printf("%s\n", lines[i]);
bucketsort((void **) lines, lcur, NULL, NULL, NULL);
for (i = 0; i < lcur; i++)
printf("%s\n", lines[i]);
{
for (i = 0; i < lcur; i++)
free(lines[i]);
free(lines);
}
return 0;
}
void radixsort(int a[],int i,int n)
{
bucketsort(a,i+1,n);
return;
}
