programatically how to sort an array in c#

Question

1.00/5 (1 vote)

See more:

how to sort an array(instead arr.sort() method).

how can we found first max or second max programatically.

Regards
James

Posted 18-May-12 1:45am

jameschowdaree

Add a Solution

Comments

Ed Nutting 18-May-12 7:50am

Sorry your question is unclear to me. What do you mean "first max" or "second max"? What do you mean by "max"? "Max" what exactly? Maximum value or maximum sort speed? Also, if you're looking for sorting algorithms, just type "Sorting Algorithms" or "C~ Sorting Algorithms" into Google and you will find a lot of very helpful information which will answer your questions.

Thanks,
Ed

3 solutions

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)

Stephen Hewison · Answer 1 · 2012-05-18T01:49:00

Use LINQ.

C#

list = list.OrderByDescending(x => x).toList();

Then write a method to get a distinct list such as:

C#

public static IEnumerable<TSource> DistinctBy<TSource,TKey>
    (this IEnumerable<TSource> source, Func<TSource, TKey> keySelector)
{
    HashSet<tkey> seenKeys = new HashSet<tkey>();
    foreach (TSource element in source)
    {
        if (seenKeys.Add(keySelector(element)))
        {
            yield return element;
        }
    }
}

Then the first max will be list[0], the second will be list[1] e.t.c.

Not Active · Answer 2 · 2012-05-18T01:50:00

Solution 2

http://code.msdn.microsoft.com/101-LINQ-Samples-3fb9811b[^]

Look under the Aggregate Operators column

Posted 18-May-12 1:50am

Not Active

vangapally Naveen Kumar · Answer 3 · 2012-05-18T01:52:00

Solution 3

by using sorting techniques u will sort an array elements
ex:Sorting Algorithms Codes in C#.NET[^] quick sort

see this link it may help you

Posted 18-May-12 1:52am

vangapally Naveen Kumar