@atul instead of sorting the string individually which would require tc- O(nlogn) shouldnot it be a better idea to use the sum of the ascii values of the individual alphabets as the key which would require tc-O(n) ???
On Sun, May 13, 2012 at 7:07 PM, GAURAV CHAWLA <[email protected]>wrote: > @deepikaanand: > > > 1 is not a prime no. and also ignore 2 as chosen prime no,. > > On Sun, May 13, 2012 at 6:31 PM, deepikaanand <[email protected]>wrote: > >> >> @gaurav >> the approach suggested as : to have an array of 25 prime nos..How is >> it supposed to work ; >> cz(this is wat i have understood) if a :0 ,b:1,c:3,d:5,e:7 >> then be = b + e = 1+7 =8 >> and dc = d + c =5 +3 = 8.. >> >> -- >> 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. >> >> > > > -- > Regards, > GAURAV CHAWLA > +919992635751 > +919654127192 > > > > > -- > 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. > -- 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.
