countingsort

#include <stdio.h>
#include <string.h>

#define WORD_SIZE 10
#define POSITIONS 100

struct word {
    int position;
    char term[WORD_SIZE + 1];
};

void counting_sort(char *sorted[], struct word words[], size_t size) {
    int buckets[POSITIONS];
    int i;

   
    for (i = 0; i < POSITIONS; i++) {
        buckets[i] = 0;
    }

    
    for (i = 0; i < size; i++) {
        buckets[words[i].position]++;
    }

    
    for (i = 1; i < POSITIONS; i++) {
        buckets[i] += buckets[i - 1];
    }

    
    for (i = size - 1; i >= 0; i--) {
        sorted[--buckets[words[i].position]] = words[i].term;
    }
}

int main() {
    int n, i, max;
    char garbage[WORD_SIZE + 1];

    scanf("%d", &n);
    struct word words[n];
    char *sorted[n];

    max = n / 2;
    for (i = 0; i < max; i++) {
        scanf("%d %10s", &words[i].position, garbage);
        strcpy(words[i].term, "-");
    }
    for (; i < n; i++) {
        scanf("%d %10s", &words[i].position, words[i].term);
    }
    counting_sort(sorted, words, n);
    for (i = 0; i < n; i++) {
        printf("%s ", sorted[i]);
    }
    return 0;
}