---C++ solution---
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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    vector<char> vow;\n    bool vowels(char ch){\n        if(ch==\'A\'||ch==\'E\'||ch==\'I\'||ch==\'O\'||ch==\'U\'||ch==\'a\'||ch==\'e\'||ch==\'i\'||ch==\'o\'||ch==\'u\')\n        return true;\n        else\n        return false;\n    }\n    string sortVowels(string s) {\n        for(int i=0;i<s.size();i++){\n            if(vowels(s[i]))\n            vow.push_back(s[i]);\n        }\n        sort(vow.begin(),vow.end());\n        for(int i=0,j=0;i<s.size();i++){\n            if(vowels(s[i])){\n                s[i]=vow[j];\n                j++;\n            }\n        }\n        return s;\n    }\n};\n```
['C++']