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 me
To store N we can make a binary tree with extra data store is the no
of left nodes in tree.
now search cost is O(logN) and O(1) is the cost of finding no less
than that particular no.
also , we can update tree in O(logN) tIme.
On Sep 25, 6:16 am, Sticker <[EMAIL PROTECTED]> wrote:
> I saw your id
Get Dream Job In USA - ALL States
More then 100 Jobs Opening Here.
Apply : http://www.best4career.com/jobsInUSA.asp
Get Workpermit - H1B Visa Sponsership here.
100% Free to Apply. Get Ineterview Call Today Now.
--~--~-~--~~~---~--~~
You received this mess
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.
> In
