File: qsort_demo.m

package info (click to toggle)
cloc 2.06-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 8,064 kB
  • sloc: perl: 30,146; cpp: 1,219; python: 623; ansic: 334; asm: 267; makefile: 244; sh: 186; sql: 144; java: 136; ruby: 111; cs: 104; pascal: 52; lisp: 50; haskell: 35; f90: 35; cobol: 35; objc: 25; php: 22; javascript: 15; fortran: 9; ml: 8; xml: 7; tcl: 2
file content (47 lines) | stat: -rw-r--r-- 1,089 bytes parent folder | download | duplicates (13) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
 
#include <stdio.h>
#include <stdlib.h>

/*
        Al Danial April 25 2000
*/

#define ELEMENTS 1000

static int compar_string(const void *a, const void *b){
        return (strcmp( (char *)a, (char *)b));
}

int comp(const void *a, const void *b ) {
    return *(int *)a - * (int *)b;
}

main(){

        int x, i;
        char *string;
        struct sort_test_t {
                int s;
        } ;

        struct sort_test_t sort_test[ELEMENTS];

        /* inititalize the array */
        for (i=0;i<ELEMENTS;i++) {
                /* produce a random variable */
                x=1+(100000.0*rand()/(RAND_MAX+1.0));
                /* load the variable into the string as an array */
                sort_test[i].s = (int) x;
                /*
                printf("unsorted %d %d\n", i, sort_test[i].s);
                */
        }

        /* sort the array */
        qsort(sort_test, ELEMENTS, sizeof(sort_test[0]), &comp);

        /* output the sorted array */
        for (i=0;i<ELEMENTS;i++) {
                printf("sorted %d %d\n", i, sort_test[i].s);
        }

}