sortingAlgorithms/mainA.c at master · davappler/sortingAlgorithms · GitHub

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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#include "Array.h"
#include "Sort.h"

static const size_t ARRAY_LENGTH = 20;

/* Prototypes */

/* ------------------------------------------------------------------------- *
 * Compute the CPU time (in seconds) used by the Sort function.
 *
 * PARAMETERS
 * array        Array to sort
 * length       Number of elements in the array
 *
 * RETURN
 * seconds      The number of seconds used by Sort
 * ------------------------------------------------------------------------- */
static double cpuTimeUsedToSort(int* array, size_t length)
{
    clock_t start = clock();
   sort(array, length);

    return ((double) (clock() - start)) / CLOCKS_PER_SEC;
}


/* ------------------------------------------------------------------------- *
 * Main
 * ------------------------------------------------------------------------- */
int main(void)
{
    srand(time(NULL));//Use an integer seed to get a fix sequence

    printf("Sorting times for arrays of size %zu\n", ARRAY_LENGTH);
    printf("-----------------------------\n");
    printf("Array type | Sorting time [s]\n");
    printf("-----------------------------\n");

    // ---------------------------- Sorted array ---------------------------- //
    int* sorted = createSortedArray(ARRAY_LENGTH);
    if (!sorted)
    {
        fprintf(stderr, "Could not created sorted array. Aborting...\n");
        return EXIT_FAILURE;
    }
//--------------------------------------
    for(int h=0;h<ARRAY_LENGTH;h++)
    {
        printf("%d  ", sorted[h]);
    }
    printf("\n");
//--------------------------------------


    double sec = cpuTimeUsedToSort(sorted, ARRAY_LENGTH);
    printf("Sorted     | %f\n", sec);

//------------------------------------

    for(int h=0;h<ARRAY_LENGTH;h++)
    {
        printf("%d  ", sorted[h]);
    }
    printf("\n");
    printf("\n");

//------------------------------------
    free(sorted);

    // -------------------------- Decreasing array -------------------------- //
    int* decreasing = createDecreasingArray(ARRAY_LENGTH);
    if (!decreasing)
    {
        fprintf(stderr, "Could not created decreasing array. Aborting...\n");
        return EXIT_FAILURE;
    }


for(int h=0;h<ARRAY_LENGTH;h++)
    {
        printf("%d  ", decreasing[h]);
    }
    printf("\n");


    sec = cpuTimeUsedToSort(decreasing, ARRAY_LENGTH);
    printf("Decreasing | %f\n", sec);

    for(int h=0;h<ARRAY_LENGTH;h++)
    {
        printf("%d  ", decreasing[h]);
    }
    printf("\n");


    printf("\n");


    free(decreasing);


    // ---------------------------- Random array ---------------------------- //
    int* random = createRandomArray(ARRAY_LENGTH);
    if (!random)
    {
        fprintf(stderr, "Could not created random array. Aborting...\n");
        return EXIT_FAILURE;
    }
    for(int h=0;h<ARRAY_LENGTH;h++)
    {
        printf("%d  ", random[h]);
    }
    printf("\n");


    sec = cpuTimeUsedToSort(random, ARRAY_LENGTH);
    printf("Random     | %f\n", sec);


    for(int h=0;h<ARRAY_LENGTH;h++)
    {
        printf("%d  ", random[h]);
    }
    printf("\n");

    printf("\n");
    free(random);

    printf("-----------------------------\n");


    return EXIT_SUCCESS;
}