Re: [algogeeks] How to write the algorithm for longest increasing subsequence problem with complexity O(n logn)

@coder have u read the question ? -- Amol Sharma Third Year Student Computer Science and Engineering MNNIT Allahabad On Tue, Aug 2, 2011 at 11:04 AM, kumar raja wrote: > @coder: > How is that?? > > > On 1 August 2011 11:43, coder dumca wrote: > >> it can be done in O(n) >> >> >> On Mon, Aug

Re: [algogeeks] How to write the algorithm for longest increasing subsequence problem with complexity O(n logn)

@coder: How is that?? On 1 August 2011 11:43, coder dumca wrote: > it can be done in O(n) > > > On Mon, Aug 1, 2011 at 5:37 AM, kumar raja wrote: > >> I have seen the code in algorithmist ,but i am not getting it. >> >> @Piyush >> >> how will u solve it using 2-4 tree >> >> On 31 July 2011 23:39

Re: [algogeeks] How to write the algorithm for longest increasing subsequence problem with complexity O(n logn)

it can be done in O(n) On Mon, Aug 1, 2011 at 5:37 AM, kumar raja wrote: > I have seen the code in algorithmist ,but i am not getting it. > > @Piyush > > how will u solve it using 2-4 tree > > On 31 July 2011 23:39, Piyush Gaurav wrote: > >> u need a 2,4 tree for dat >> >> >> On 1 August 2011 1

Re: [algogeeks] How to write the algorithm for longest increasing subsequence problem with complexity O(n logn)

I have seen the code in algorithmist ,but i am not getting it. @Piyush how will u solve it using 2-4 tree On 31 July 2011 23:39, Piyush Gaurav wrote: > u need a 2,4 tree for dat > > > On 1 August 2011 11:59, Amol Sharma wrote: > >> can be done with some modification on dp solution of O(n^2)..

Re: [algogeeks] How to write the algorithm for longest increasing subsequence problem with complexity O(n logn)

u need a 2,4 tree for dat On 1 August 2011 11:59, Amol Sharma wrote: > can be done with some modification on dp solution of O(n^2). > > i am comfortable with the O(n^2) solution. but i am also having > difficulty in O(nlogn) solution > > check this link > http://www.algorithmist.com/ind

Re: [algogeeks] How to write the algorithm for longest increasing subsequence problem with complexity O(n logn)

can be done with some modification on dp solution of O(n^2). i am comfortable with the O(n^2) solution. but i am also having difficulty in O(nlogn) solution check this link http://www.algorithmist.com/index.php/Longest_Increasing_Subsequence -- Amol Sharma Third Year Student Computer

[algogeeks] How to write the algorithm for longest increasing subsequence problem with complexity O(n logn)

-- Regards Kumar Raja M.Tech(SIT) IIT Kharagpur, 10it60...@iitkgp.ac.in 7797137043. 09491690115. -- 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,