String sort please help

#1

#include
#include<bits/stdc++.h>
using namespace std;

int mycompare(string x,string y)
{
// if(x.prefix(y))
// {
// return y>x;
// }
return x<y;
}
int main() {
int n;
cin>>n;
string arr[100005];

for(int i=0;i<n;i++)
{
	cin>>arr[i];
}

sort(arr,arr+n,mycompare);

	for(int i=0;i<n;i++)
{
	cout<<arr[i]<<endl;
}

return 0;

}

#2

Try making a separate bool function to check if one string is the prefix of another.
If it is, then return x.size()>y.size() else x<y.

#3

Please help me make the function to check prefix

#4

Take the length of both strings(n,m) and start i from 0 to min(n,m).
If x[i] != y[i] at any point, return false.
At the end of the loop, return true.

#5

@arsh_goyal Please mark your doubt as resolved if you are satisfied.

#6

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.