How to have a Stable counting sort for a array of ID associated with the score
manage to sort a single array like {1,3,2,1,5} but does not manage to do it for below
Input:
int main()
{
struct SResult sample[] = {
{"A1234", 10},
{"A1239", 5},
{"A1394", 7},
{"A1434", 3},
{"A1454", 5},
{"A2884", 7},
{"A3235", 7},
{"A4334", 9},
{"A4884", 2},
{"A6934", 5},
{"A7265", 7},
{"A9559", 3}
};
struct SResult sorted[12] = {{0}};
int i;
counting_sort(sample, 12, sorted);
for (i = 0; i < 12; i++){
printf("[%s, %d]\n", sorted[i].studentID, sorted[i].score);
}
printf("\n");
return 0;
}
What I have tried:
struct SResult {
char studentID[6];
int score;
};
void counting_sort(struct SResult scoreArr[], int N, int final[])
{
int freq[11] = {0}, cfreq[11] = {0};
int i, curScore;
for (i = 0; i < N; i++){
freq[ scoreArr[i].score ] ++;
}
cfreq[0] = freq[0];
for (i = 1; i < 11; i++){
cfreq[i] = cfreq[i-1] + freq[i];
}
for (i = 0; i < N; i++){
curScore = scoreArr[i].score;
final[ cfreq[ curScore ] - 1 ] = curScore;
cfreq[curScore]--;
}
}