File browser

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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185

#include <cstdlib>
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <sys/time.h>
#include <unistd.h>

using namespace std;

// QS

void sort_quick (int *Array, int Start, int Stop) {
    int i, j, x;
    x = Array[(Start + Stop) / 2];
    i = Start;
    j = Stop;
    do {
        while (Array[i] < x) ++i;
        while (Array[j] > x) --j;
        if (i <= j) {
            int tmp = Array[i];
            Array[i] = Array[j];
            Array[j] = tmp;
            ++i;
            --j;
            }
    } while (i < j);
    if (Start < j) sort_quick (Array, Start, j);
    if (Stop > i) sort_quick (Array, i, Stop);
    }

// HS

void sift_in (int *Array, int Length, int FreeIn, int Next) {
    int i;
    int Free = FreeIn;
    for (i = (2 * Free); i < Length; i += i){
        if (Array[i] < Array[i + 1]) i++;
        Array[Free] = Array[i];
        Free = i;
        }
    if (i == Length) {
        Array[Free] = Array[i];
        Free = i;
        }
    while (((i = (Free / 2)) >= FreeIn) && Array[i] < Next) {
        Array[Free] = Array[i];
        Free = i;
        }
    Array[Free] = Next;
    }

void sort_heap (int *Array, int Length) {
    int i;
    if (Length <= 1) return;
    Array -= 1;
    for (i = (Length / 2); i >= 1; i--) {
        int Next = Array[i];
        sift_in (Array, Length, i, Next);
        }
    for (i = (Length - 1); i >= 1; i--) {
        int Next = Array[i + 1];
        Array[i + 1] = Array[1];
        sift_in (Array, i, 1, Next);
        }
    }

// MS

void merge (int *Array, int Start, int Middle, int Stop) {
    int TabOut[Stop - Start + 1];
    int i1 = Start;
    int i2 = (Middle + 1);
    int io = 0;
    int k;
    while ((i1 <= Middle) && (i2 <= Stop)) {
        if (Array[i1] < Array[i2]) TabOut[io++] = Array[i1++];
        else TabOut[io++] = Array[i2++];
        }
    if (i1 > Middle) {
        for (k = i2; k <= Stop; k++, io++) TabOut[io] = Array[k];
        }
    else {
        for (k = i1; k <= Middle; k++, io++) TabOut[io] = Array[k];
        }
    for (k = Start; k <= Stop; k++) Array[k] = TabOut[k - Start];
    }

void sort_merge (int *Array, int Start, int Stop) {
    if (Start == Stop) return;
    int Middle = ((Start + Stop) / 2);
    sort_merge (Array, Start, Middle);
    sort_merge (Array, (Middle + 1), Stop);
    merge (Array, Start, Middle, Stop);
    }

// pobieranie czasu

double time () {
    struct timeval tv;
    struct timezone tz;
    gettimeofday (&tv, &tz);
    return (((1.0 * tv.tv_usec) / 1000000) + tv.tv_sec);
    }

// program glowny

int main () {
    int Option = 1, Step = 10000;
    double Start;
    char Sorts[3][25] = {"szybkie (QS)", "przez kopcowanie (HS)", "przez scalanie (MS)"};
    char Types[5][15] = {"stale", "losowe", "malejace", "rosnace", "V - ksztaltne"};
    int Array[150000];
    fstream File;
    while (Option) {
        fflush (stdin);
        cout << "Wybierz opcje:\n"
        << "\t1 - sortowanie szybkie (QS);\n"
        << "\t2 - sortowanie przez kopcowanie (HS);\n"
        << "\t3 - sortowanie przez scalanie (MS);\n"
        << "\t0 - koniec programu.\n";
        fflush (stdin);
        cin >> Option;
        if (!Option) {
            cout << "Koniec programu.\n";
            return 0;
            }
        else if (Option > 0 && Option < 4) {
            cout << "Sortowanie " << Sorts[Option - 1] << "\n";
            for (int i = 0; i < 5; i++) {
                cout << "Dane " << Types[i] << ":\n";
                for (int j = 1; j < 16; j++) {
                    if (i > 0 && i < 4) {
                        File.open (Types[i], ios::in);
                        if (File.fail ()) {
                            cout << "Wystapil blad podczas proby otwarcia pliku!\n";
                            break;
                            }
                        for (int k = 0; k < (j * Step); k++) File >> Array[k];
                        File.close ();
                        }
                    else if (!i) {
                        for (int k = 0; k < (j * Step); k++) Array[k] = 1;
                        }
                    else {
                        File.open ("rosnace", ios::in);
                        if (File.fail ()) {
                            cout << "Wystapil blad podczas proby otwarcia pliku!\n";
                            break;
                            }
                        for (int k = 0; k < (j * (Step / 2)); k++) File >> Array[k];
                        File.close ();
                        File.open ("malejace", ios::in);
                        if (File.fail ()) {
                            cout << "Wystapil blad podczas proby otwarcia pliku!\n";
                            break;
                            }
                        for (int k = 0; k < (j * (Step / 2)); k++) File >> Array[k];
                        File.close ();
                        }
                    Start = time ();
                    switch (Option) {
                        case 1:
                        sort_quick (Array, 0, ((j * Step) - 1));
                        break;
                        case 2:
                        sort_heap (Array, (j * Step));
                        break;
                        case 3:
                        sort_merge (Array, 0, ((j * Step) - 1));
                        break;
                        }

// mala weryfikacja sortowania

                    /*for (int k = 0; k < 10; k++) cout << Array[k] << ", ";
                    cout << "\n";*/
                    cout << "\t" << (j * Step) << " (" << ((time () - Start) * 1000000) << " ms)\n";
                    }
                }
            }
        else cout << "Niewlasciwa opcja!\n";
        }
    return 0;
    }