Simple C code
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: O(n log n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nint compareVowels(const void *a, const void *b) {\n    return (*(char *)a - *(char *)b);\n}\n\nchar *sortVowels(char *s) {\n    int n = strlen(s);\n\n    // Create arrays to store vowels and their indices\n    char vowels[n];\n    int vowelIndices[n];\n    int vowelCount = 0;\n\n    // Iterate through the string to separate vowels and consonants\n    for (int i = 0; i < n; i++) {\n        if (strchr("aeiouAEIOU", s[i]) != NULL) {\n            vowels[vowelCount] = s[i];\n            vowelIndices[vowelCount] = i;\n            vowelCount++;\n        }\n    }\n\n    // If there are no vowels, return the original string\n    if (vowelCount == 0) {\n        return strdup(s);\n    }\n\n    // Sort vowels using the custom comparator\n    qsort(vowels, vowelCount, sizeof(char), compareVowels);\n\n    // Construct the resulting string\n    char *result = strdup(s); // Duplicate the original string\n    for (int i = 0; i < vowelCount; i++) {\n        result[vowelIndices[i]] = vowels[i];\n    }\n\n    return result;\n}\n```
['C']