Question

Provide a C++ implantation using tries of a Lexicographic Sorting of Strings in Alphabetical Order. Given arr: An array of String pointers, and n: The number of Strings provided. And this must output arr that must be directly modified such that it's contents are in lexicographically sorted order. Given the function: void sort(String* arr[], int n).

Answer 1

Code:-

#include <bits/stdc++.h>
using namespace std;
  
const int MAX = 26;
  
struct trie {
int indexvalue; //for indexing
trie* childvalue[MAX]; //taking childvalue
trie()
{
for (int i = 0; i < MAX; i++)
childvalue[i] = NULL; //initially declare child value with NULL
indexvalue = -1; //initializing indexvalue to -1
}
};
bool order(trie* ptr, string array[]) //function for displaying strings present in sorted array
{
if (ptr == NULL) //if ptr is null return false(nothing)
return false;
  
for (int i = 0; i < MAX; i++) { //loop until last child
if (ptr->childvalue[i] != NULL) { //if ptr->childvalue have a string
if (ptr->childvalue[i]->indexvalue != -1)
cout << array[ptr->childvalue[i]->indexvalue] << endl; //printing string
order(ptr->childvalue[i], array); //recursive call to order function
}
}
}
void sort(string arr[], int n){
trie* rootvalue = new trie();
for (int i = 0; i < n; i++){
   trie* ptr = rootvalue; //initialize ptr pointer to root
       for (int j = 0; j < arr[i].size(); j++) {
       char value = arr[i][j] - 'a'; //taking ascii value to find index of child
       if (!ptr->childvalue[value])
       ptr->childvalue[value] = new trie();  
       ptr = ptr->childvalue[value];
       }
       ptr->indexvalue = i;
   }
order(rootvalue, arr);
}
int main()
{
string arrstrings[] = { "abc", "dce", "bcd","fed","acb" };
int length = sizeof(arrstrings) / sizeof(arrstrings[0]);
sort(arrstrings, length);
return 0;
}

Output:-

sabc acb bcd dce fed Process exited after @.@984 seconds with return value o Press any key to continue . . .