Do we really need to reverse? Can't we apply any normal sorting algo like merge sort or quick sort and for the comparison part of it, use the last characters of each string only?
On Jun 27, 4:21 am, varun pahwa <[email protected]> wrote: > reverse all strings and then sort. > > On Mon, Jun 27, 2011 at 2:28 PM, Nishant Mittal > <[email protected]>wrote: > > > WAP to sort an array of character strings on the basis of last > > character of each string > > eg:- {xxxc , yyya, zzzb} => {yyya , zzzb, xxxc} > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to [email protected]. > > To unsubscribe from this group, send email to > > [email protected]. > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en. > > -- > Varun Pahwa > B.Tech (IT) > 7th Sem. > Indian Institute of Information Technology Allahabad. > Ph : 09793899112 ,08011820777 > Official Email :: [email protected] > Another Email :: [email protected] > > People who fail to plan are those who plan to fail. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
