@shashank , i agree. To reduce this overhead , we can implement prefix trie in bit-form or DAWG or lots of compression techniques are there at the cost of complex coding.
On Tue, Nov 1, 2011 at 12:35 AM, WgpShashank <shashank7andr...@gmail.com>wrote: > @Mohit Space Overhead Will be more if m,n are large isn't it ? > > > Shashank > > -- > 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/-/Z9zOwDig0mMJ. > > 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. > -- Mohit -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. 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.
