// Function to sort strings lexicographically
int lexicographic_sort(const char* a, const char* b) {
    return strcmp(a, b);
}

// Function to sort strings in reverse lexicographical order
int lexicographic_sort_reverse(const char* a, const char* b) {
    return strcmp(b, a);
}

// Function to sort strings by the number of distinct characters
int sort_by_number_of_distinct_characters(const char* a, const char* b) {
    // Count distinct characters in string a
    int count_a[256] = {0};
    int distinct_count_a = 0;
    for (const char* p = a; *p != '\0'; p++) {
        if (!count_a[(unsigned char)*p]) {
            distinct_count_a++;
            count_a[(unsigned char)*p] = 1;
        }
    }

    // Count distinct characters in string b
    int count_b[256] = {0};
    int distinct_count_b = 0;
    for (const char* p = b; *p != '\0'; p++) {
        if (!count_b[(unsigned char)*p]) {
            distinct_count_b++;
            count_b[(unsigned char)*p] = 1;
        }
    }

    // Compare distinct character counts
    if (distinct_count_a == distinct_count_b) {
        return lexicographic_sort(a, b);
    }
    return distinct_count_a - distinct_count_b;
}

// Function to sort strings by their lengths
int sort_by_length(const char* a, const char* b) {
    int len_a = strlen(a);
    int len_b = strlen(b);
    if (len_a == len_b) {
        return lexicographic_sort(a, b);
    }
    return len_a - len_b;
}

// Function to sort an array of strings using a given comparison function
void string_sort(char** arr, const int len, int (*cmp_func)(const char* a, const char* b)) {
    for (int i = 0; i < len - 1; i++) {
        for (int j = 0; j < len - i - 1; j++) {
            if (cmp_func(arr[j], arr[j + 1]) > 0) {
                char* temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
}