Sorting algo for an array

Question

0.00/5 (No votes)

See more:

Hi Guys!

I was thinking for sorting algo,i have written a small algo for this...can it be more refined...

int[] unSortedArray = { 9, 4, 5, 1,7, 3, 8, 2, 6 };
           int j = 0;
           for (int i = 0; i < (unSortedArray.Length - 1) * (unSortedArray.Length - j); i++)
           {
               if (i == unSortedArray.Length - j -1)
               {
                   i = 0;
                   j++;
               }
               if (unSortedArray[i] > unSortedArray[i + 1])
               {
                   int temp = unSortedArray[i];
                   unSortedArray[i] = unSortedArray[i + 1];
                   unSortedArray[i + 1] = temp;
               }

           }

Any thought is appreciated!!!

Regards,
Vikas

Posted 1-Oct-13 17:00pm

tasumisra

Updated 1-Oct-13 17:08pm

Kenneth Haugland

v2

Add a Solution

Comments

phil.o 3-Oct-13 11:53am

Sorting algorithms come by all kinds and performances.
The first link given by Kenneth Haughland right below has been a must for me when it comes to sorting algorithms. You can try each of them and measure their performance in your specific context, then choose which one is the most suitable.

2 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)

Kenneth Haugland · Answer 1 · 2013-10-01T17:08:00

Solution 1

You could proberbly find the algorithm here:
Visualization and comparison of sorting algorithms in C#[^]

Although what you are trying to do seems to be a bit overkill, as you could write a predicate to go with array sorting. Like this:
http://www.csharp-examples.net/sort-array/[^]

Posted 1-Oct-13 17:08pm

Kenneth Haugland

Updated 1-Oct-13 17:12pm

v2

Comments

phil.o 3-Oct-13 11:53am

5'd!

Kenneth Haugland 3-Oct-13 12:41pm

Thanks.

londhess · Answer 2 · 2013-10-03T05:29:00

You can used build in function present in the c#.
Please see the below example

C#

using System;

class Program
{
    static void Main()
    {
    // Simple sort call.
    int[] values = {1,5,3,0,3,5,7 };
    Array.Sort(values);
    foreach (int value in values)
    {
        Console.Write(value);
        Console.Write(' ');
    }
    Console.WriteLine();
    }
}