it is really good algorithm
On 8/2/11, Deepak giggs wrote:
> @varun : clear :) thanks...
>
> On Mon, Aug 1, 2011 at 11:44 PM, kartik sachan
> wrote:
>
>> similar type algo is there in geeksforgeeks.org in array section from
>> there u can understand it better way
>>
>> --
>>
@varun : clear :) thanks...
On Mon, Aug 1, 2011 at 11:44 PM, kartik sachan wrote:
> similar type algo is there in geeksforgeeks.org in array section from
> there u can understand it better way
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks"
similar type algo is there in geeksforgeeks.org in array section from there
u can understand it better way
--
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 th
On Aug 1, 6:25 pm, Deepak wrote:
> Given an array of elements 'n'. some k elements such that the repalced elements are missing elements, without wasting any extra memory.
I think you did not phrase the question correctly. I am assuming you
meant an array of n-numbers from [1,n]. Here, khttp://
