@kartik : question says inplace ..... so using hashing would be violation... i dont think so it can be done if array is unsorted and with given restriction
On Wed, Feb 15, 2012 at 10:05 AM, Kartik Sachan <kartik.sac...@gmail.com>wrote: > if n is less than 10^6 hasing works fine ..and we count in O(1) time only > > -- > 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. > -- 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.
