UBB
/
sort
1
0
Fork 0
Code Issues Pull Requests Releases 3 Activity

fix generation of random numbers to be more dynamic

This commit is contained in:
Chris Cromer 2018-11-11 20:15:30 -03:00
parent 893d47bf2e
commit a31eababb7
Signed by: cromer
GPG Key ID: 39CC813FF3C8708A
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/sort.c
View File

@ -63,7 +63,7 @@ void print_array(int *array, int n) {
for (i = 0; i < n; i++) { for (i = 0; i < n; i++) {
fprintf(stdout, "%d ", array[i]); fprintf(stdout, "%d ", array[i]);
} }
fprintf(stdout, "\n"); fprintf(stdout, "\n\n");
} }
/** /**
@ -189,12 +189,12 @@ int main (int argc, char **argv) {
array[i] = opt; array[i] = opt;
} }
else { else {
array[i] = gen_rand(-1000, 5000); array[i] = gen_rand((n * 10) * -1, n * 10);
} }
} }
if (imprimir) { if (imprimir) {
fprintf(stdout, "\nAntes:\n"); fprintf(stdout, "Antes:\n");
print_array(array, n); print_array(array, n);
} }

2
test/test.c
View File

@ -81,7 +81,7 @@ int main(int argc, char **argv) {
// Prepare for sort tests // Prepare for sort tests
for (i = 0; i < n; i++) { for (i = 0; i < n; i++) {
test_case[i] = gen_rand(-20, 100); test_case[i] = gen_rand(-100, 100);
} }
memcpy(qarray, test_case, sizeof(int) * n); memcpy(qarray, test_case, sizeof(int) * n);
memcpy(test_array, test_case, sizeof(int) * n); memcpy(test_array, test_case, sizeof(int) * n);