isnt this a DP problem ? I think its there in CLRS. Let me know.
Cheers Supraja J On Wed, May 11, 2011 at 7:55 AM, Harshit Gangal <harshit.gan...@gmail.com>wrote: > How can we calculate the number of divisors a number have in minimum time > or having minimum Time Complexity. > > -- > Harshit Gangal > Fourth Year Undergraduate Student > Dept. of Computer Science > JIIT, Noida , India > > -- > 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. > -- U -- 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.
