how can that array be constructed efficiently? convert binary to that base?
On Sep 27, 4:02 am, MD <[EMAIL PROTECTED]> wrote: > If we have enough memory.. we could probably have a array to hold > values for > numbers in each base and sum it and output the value.. :) efficiency > at the cost of memory. > > On Sep 25, 5:12 pm, Mgccl <[EMAIL PROTECTED]> wrote: > > > is there a known, efficient digit sum algorithm exist for any base. > > Input any number and base, it will return the digit sum in that base? > > please tell if you know anything about this :) > > thxhttp://mathworld.wolfram.com/DigitSum.html --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
