.Sort code in .net

[virendra_sharma]

Hi ,

i need code , which is used for sorting in c# i.e. .sort method code., somewhere i read that they use quick sort algorithm , can anyone plz help me by giving the code.

Thanks in Advance

[ddanbe]

The sort method code may be different depending on the class were it belongs to.
I don't know and I really don't care very much, as long as it does the job!
Also have a look at this excellent snippet : http://www.daniweb.com/software-development/csharp/code/351309

[Mitja Bonca]

Hello
would you mind telling to Sort what exactly?
An array, listArray, generic list<T>, dictionary collections, or else?

You have to be specific, and which technique do you want to use?

For the Arrays there is a method "Sort" avaiable, then you have a Linq, a very powerful tool in C# (since version 2.0 and leter). Using Lambda Expressions, allows you to do almost any kind of sorting and stuff.
In linq you use methods like "Sort, and OrderBy, but a bit differently then for the Array.

//1. array Sort:
            string[] strArray = { "b", "d", "a" };
            int[] intArray = { 23, 43, 3, 2 };
            Array.Sort(strArray); //asc
            Array.Reverse(strArray); //des
            Array.Sort(intArray);//asc            

            //2.Linq on generic List<T>:
            List<string> list1 = new List<string>();
            list1.AddRange(new string[] { "b", "d", "a" });
            list1 = list1.OrderBy(o => o[0]).ToList();

            List<int> list2 = new List<int>();
            list2.AddRange(new int[] { 23, 43, 3, 2 });
            list2.Sort((x, y) => Convert.ToInt32(x).CompareTo(Convert.ToInt32(y)));
            //to show results:
            foreach (int number in list2)
            { 
             //number is the value (one by one - in sorted ascending order!
            }

[C#Jaap]

This is the most quick sorting algorithm I know:

namespace sort
{
    class Program
    {
        static void Main(string[] args)
        {
            List<string> sortList = new List<string>();
            sortList.Add("X");
            sortList.Add("B");
            sortList.Add("K");
            sortList.Sort();

            for(int i = 0; i < sortList.Count; i++ ) Console.WriteLine(sortList[i]);

            Console.ReadKey();
        }
    }
}

But it may not work in your case..... e.g. when you have to sort objects. In that case the class you want to sort should implement the interface IComparer. See http://msdn.microsoft.com/en-us/library/system.collections.icomparer.aspx

[virendra_sharma]

hi ,

i appreciate you , but as i am new in .Net i am not getting what i have to do.

i want to read text(.txt) file and want to sort it accordingly , the link that you have given to me from that i am not getting from where to read my text file and how to sort it,
can you plz help me for this.

Thanks in Advance
:)

[C#Jaap]

Do you want to sort the text line in the text-file?

In that case you have to read all lines from the text-file and add them to List<string> sortList = new List<string>(); After that you can sort the List and write it to another/the text-file

[Momerath]

Do you want to sort the text line in the text-file?

In that case you have to read all lines from the text-file and add them to List<string> sortList = new List<string>(); After that you can sort the List and write it to another/the text-file

It's much easier than that:

string[] lines = File.ReadAllLines("MyFile.txt");
Array.Sort(lines);
File.WriteAllLines("MyFile.txt", lines);

[virendra_sharma]

Code is given below

[virendra_sharma]

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;


namespace quik
{
    class Quicksort
    {
        public static void qsort(string[] items)
        {
            qs(items, 0, items.Length - 1);
        }

       
        static void qs(string[] items, int left, int right)
        {
            int i, j;
            string x, y;

            i = left; j = right;
            x = items[(left + right) / 2];

            do
            {
                while ((items[i].CompareTo(x)< 0) &&(i < right)) i++;
                while ((x.CompareTo(items[j])<0) && (j > left)) j--;

                if (i <= j)
                {
                    y = items[i];
                    items[i] = items[j];
                    items[j] = y;
                    i++; j--;
                }
            } while (i <= j);

            if (left < j) qs(items, left, j);
            if (i < right) qs(items, i, right);
        }
    }

    public class QS
    {
        public static void Main()
        {
           // char[] a = { 'v', 'i', 'r', 'e', 'n', 'd', 'r' ,'a'};
            string[] a = System.IO.File.ReadAllLines(@"C:\\3.txt");
            int i;

            //Console.Write("Original array: ");
            //for (i = 0; i < a.Length; i++)
            //    Console.Write(a[i]);

            //Console.WriteLine();

          
            Quicksort.qsort(a);


            using (System.IO.StreamWriter abc = new System.IO.StreamWriter(@"C:\write11.txt"))
            {
                for ( i = 0; i < a.Length; i++)
                {
                    abc.WriteLine("{0}", a[i]);
                }

            }
           
            //for (i = 0; i < a.Length; i++)
            //    Console.Write(a[i]);
        }
    }
}