longest decreasing subsequence of array

Question

1.00/5 (1 vote)

See more:

hello to all
i want to find longest decreasing subsequence of array
int [] arr={5,8,4,3,2,10,9,7,5,3,12,2}
in C# how to do this help me

Posted 3-Feb-12 20:02pm

Niki Jain

Updated 3-Feb-12 20:17pm

v2

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

OriginalGriff · Answer 1 · 2012-02-03T21:53:00

Since this is your homework, I won't give you code.

However, there are a lot of different ways to do this, starting with the Brute-Force-And-Ignorance approach of nested loops, and ending with creating a tree for each node.

Google will help you, but I can't - I don't know how much experience you have (although I suspect not much) and so can't recommend a solution based on what you know how to do.

If everything else fails, Brute-Force-And-Ignorance is an easy to implement approach, although somewhat slow!