I think we can use the counting sort method...
On Tue, Mar 13, 2012 at 1:51 AM, sunny agrawal wrote:
> @atul
> if its sum of numbers lesser than a[i] in left to i, then still i think it
> can be solved in O(nlgn) using Balanced Tree structures
> ie: if we use AVL tree, then we just need a
Samsung Bangalore..
I am working here.
On Fri, Sep 2, 2011 at 8:21 PM, rahul sharma wrote:
> plz guys tell me wich samsung is better out of 3 in india...n
> plz suggest should i apply for samsung noida or not???
>
> --
> You received this message because you are subscr
partitioning the element as in quicksort will work
On Thu, Jul 21, 2011 at 11:36 PM, SkRiPt KiDdIe wrote:
>
>
> Div n Conquer O(nlogn)
>
>
>> Thanks
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send
refer Fourier transform and wavelet transform of image
On Tue, Jul 12, 2011 at 7:38 PM, bittu wrote:
> too store this whole image we need 2^70==10^21 bytes size of disk.
> assuming each pixel take 1 byte . always go metadata for large
> entities .here metadata includes type(e.g jpeg,bmp,gif
> et
@aanchal
correction:
deletion is also O(1);
On Tue, Jul 12, 2011 at 8:31 PM, santosh mahto wrote:
> @aanchal
>
> u are correct in first case.
>
> deletion is also not O(1). because while freeing we pass the address. so
> with that address it can directly reach the node
>
@aanchal
u are correct in first case.
deletion is also not O(1). because while freeing we pass the address. so
with that address it can directly reach the node
which is to be freed.
Thanks
Santosh
On Tue, Jul 12, 2011 at 7:32 PM, ankit sambyal wrote:
> I think the allocation of address in cas
this will help
->sizeof operator only need declaration not definition.since sizeof operator
calculates size at
compile time.
At compile time code doesnot seek for definition.it only need declaration.if
any variable is declared with extern,it thinks that
its definition will be found at linking time
@sunny
the no of set bits in m will tell what all length(4,2 in above case)
are need to be merged.
e.g if if m ==6 then m = 0110
since bit set position are 2 and 1.
so length of rope need to combine is 2^2=4 and 2^1 = 2;i.e 4 and 2
Thnaks
Santosh
On Sat, Jul 2, 2011 at 2:58 PM, santosh mahto
@sunny
that will work fine(xoring).
In place of Xoring u can also do OR of two number and find the distance
between fist set bit from left and first set bit from right,
Since bit operation is really fast operation so best algo this is of
complexity O(1);
Explanation How it works:
In l only one
