-
Notifications
You must be signed in to change notification settings - Fork 1
/
num_generator.c
49 lines (45 loc) · 1.5 KB
/
num_generator.c
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
/* Sorting Algorithm Animations.
* Copyright (C) 2015 kaniket21@gmail.com Aniket Kulkarni.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "sort_animation.h"
int num_generator(data *p) {
int i, max = 10, flag;
time_t tt;
p->numbers = (int *)malloc(p->elements * sizeof(int));
if(p->numbers == NULL) {
fprintf(stdout, "\vmalloc failed: %s\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t \v", strerror(errno));
endwin();
exit(0);
}
srandom(time(&tt));
for(i = 0; i < p->elements; i++)
p->numbers[i] = random() % max;
for(i = 0; i < p->elements - 1; i++) { /* this loop checks if the random numbers generated are already in sorted order */
if(p->numbers[i] <= p->numbers[i + 1])
flag = 0;
else
flag = 1;
}
if(flag == 0)
return 1;
else
return 0;
}
void message(int max_y) {
mvprintw(max_y / 4, 0, "Generating random numbers...");
refresh();
return;
}