Lexicographical sorting

#1

Is there any technique for lexicographical sorting other than simple approach like finding char at i position and comparing them

#2

@imrsachin,
you need to compare the chars for lexicographical sorting.

one approach can be:

You need to define your own comparator for this problem.
Something like this:

        int i = 0;      

        while (i < s1.length() && i < s2.length()) {

            if (s1[i] > s2[i]) {

                return 1;
            } else if (s1[i] < s2[i]) {
                return -1;
            }
            i++;

        }

        if (s1.length() > s2.length()) {
            return -1;
        } else {
            return 1;
        }

Compare the characters one by one and make sure that i < s1.length() && i < s2.length(). If there exists a prefix, the next ’ if ’ condition will take care of it.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.