🔥C++ Solution [ Sorting]🔥 With Explaination🔥
Explaination\nThe code aims to sort the vowels in a given string s in ascending order. It does this by first extracting all the vowels from the string, sorting 
# Explaination\nThe code aims to sort the vowels in a given string s in ascending order. It does this by first extracting all the vowels from the string, sorting them, and then replacing the original vowels in the string with the sorted vowels.\n\n# Complexity\n- Time complexity: O(NLogN), Sort the array\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(N), to store vowels\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    bool isVowel(char ch) {\n        ch = tolower(ch);\n        return ch == \'a\' || ch == \'e\' || ch == \'i\' || ch == \'o\' || ch == \'u\';\n    }\n    \n    string sortVowels(string s) {\n        vector<int> store;\n        for(int i=0;i<s.size();i++){\n            if(isVowel(s[i])){\n                char ch= s[i];\n                int a= (int)ch;\n                store.push_back(a);\n            }\n        }\n        int j=0;\n        sort(store.begin(),store.end());\n        for(int i=0;i<s.size();i++){\n            if(isVowel(s[i])){\n                int num= store[j];\n                char ch= (char)num;\n                s[i]=ch;\n                j++;\n            }\n        }\n        return s;\n    }\n};\n```
['C++']