omr/critical-thinking
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

finished unweighted ranking, only 14 more techniques to go

Browse Source
This commit is contained in:
Om Raheja 2024-08-26 17:49:28 -04:00
parent b034f6ea7f
commit 5b26e72a7a
1 changed files with 7 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
rank.c
View File

@ -90,11 +90,12 @@ main(void)
// insertion sort: the array **should be** nearly sorted // insertion sort: the array **should be** nearly sorted
isort(matrix, sorted_strings, sorted_winners, i); isort(matrix, sorted_strings, sorted_winners, i);
// print out the results printf(BOLDRED "Original: " RESET " | " BOLDGREEN "Sorted: " RESET "\n\n");
for (int j = 0; j < i; j++) { for (int j = 0; j < i; j++) {
printf("%s: %d\n", sorted_strings[j], sorted_winners[j]); printf("%s: %d | %s: %d\n",
strings[j], winners[j],
sorted_strings[j], sorted_winners[j]);
} }
return 0; return 0;
} }
@ -109,22 +110,14 @@ isort(char matrix[][M_STR], char name[][M_STR_LEN], int *value, int len) {
int j = i - 1; int j = i - 1;
// test while (j >= 0 && (value[j] < key || matrix[i][j]) ) {
printf("%s: %d %d\n", name[i], value[i], i);
while (j >= 0 && value[j] < key ) {
// test
printf("key: %d, j: %d, value[j]: %d, value[j+1]: %d, name[j]: %s, name[j+1]: %s\n", key, j, value[j], value[j + 1], name[j], name[j + 1]);
// matrix print at value
printf("matrix[%d][%d]\n", j, i);
value[j + 1] = value[j]; value[j + 1] = value[j];
strncpy(name[j + 1], name[j], M_STR_LEN); strncpy(name[j + 1], name[j], M_STR_LEN);
j--; j--;
} }
value[++j] = key; value[++j] = key;
strncpy(name[j + 1], str_key, M_STR_LEN); strncpy(name[j], str_key, M_STR_LEN);
} }
return; return;