It should be O(n.m.log m) the hash fn choosed here was "sorted_char_string" --> abc, bac, cba, ... all result in abc.
how about, (a*b*c)+ (a+b+c) --> it can store the space considerably, if we use a integer, (just m) instead of log m. but we need to prove that for any two sets of integers (a1,b1,c1) & (a2,b2,c2) --> cannot satisfy abc + (a+b+c) aleast for a smaller range of integers (1..26) or for any arbitary 26 different +ve numbers. can any maths person can comment on this approach. If not, an alternate hash is needed to save order of (log m) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/7fLG2pU-ia8J. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
