// improved by Aaron Eberhardt #include using namespace std; vector ones{ "","one", "two", "three", "four", "five", "six", "seven", "eight", "nine" }, teens{ "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen","sixteen", "seventeen", "eighteen", "nineteen" }, tens{ "", "", "twenty", "thirty", "forty", "fifty", "sixty", "seventy", "eighty", "ninety" }; bool Lexicographical(string s, string s2) { size_t l = min(s.length(), s2.length()); for (size_t j = 0; j < l; j++) { if (s[j] > s2[j]) return true; else if (s[j] < s2[j]) return false; } return (s.length() < s2.length()); } string NumToWord(int no) { if (no < 10) return ones[no]; else if (no < 20) return teens[no - 10]; else if (no < 100) return tens[no / 10] + ((no % 10 != 0) ? "" + NumToWord(no % 10) : ""); else if (no < 1000) return NumToWord(no / 100) + "hundred" + ((no % 100 != 0) ? "" + NumToWord(no % 100) : ""); return "failed"; } int main(void) { srand(time(0)); vector> inp; set rand_nos; for (int i = 0; i < 50; i++) rand_nos.insert(rand() % 100 + 1); for (auto i = rand_nos.begin(); i != rand_nos.end(); i++) inp.push_back(make_pair(*i, NumToWord(*i))); cout << "Lexicographical Order using selection sort\n\n"; for (size_t i = 0; i < inp.size() - 1; i++) { size_t front = i; for (size_t j = i + 1; j < inp.size(); j++) if (Lexicographical(inp[front].second, inp[j].second)) front = j; string temp = inp[i].second; inp[i].second = inp[front].second; inp[front].second = temp; int tmp = inp[i].first; inp[i].first = inp[front].first; inp[front].first = tmp; } for (size_t a = 0; a < inp.size(); a++, cout << "\n") cout << setw(3) << inp[a].first << " " << inp[a].second; }

textual lexicographical order