SORTING OUTPUT SHOWING WRONG

#1

WHY IS IT SHOWING WRONG WHEREAS IN THE VIDEO IT WAS SAID THAT SORT FUNCTION GIVES LEXIOGRAPHICAL SORTING BY DEFAULT>

#2

Your code is giving wrong output for the given sample test case.
For this question you can make an array of strings and then sort it according to the condition that if there is a prefix match between two string, sort in decreasing order of length. Use C++ inbuilt sort function with a custom comparator something like this:

bool mycompare( string a, string b)
{
int l1=a.length();int l2=b.length();int flag=-1;
for(int i=0;i<min(l1,l2);i++){
if(a[i]!=b[i])
flag=0;
}
if(flag==-1) // means there is a prefix match
return l1>l2; // so sort decreasing order of length
else
return a<b; //sorting in normal dictionary order when no prefix match
}

#3

hello @Prakhar_Nagpal
u have reopend the doubt, if u have any doubt then feel free to ask

#4

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.