How to Sort an Array in C# | Array.Sort() Method Set - 1

// C# Program to demomstrates the use  
// of the Array.Sort<T>(T[]) Method 
using System;

class Geeks
{
    public static void Main()
    {
        // array elements
        string[] arr = new string[5] { "A", "D", "X", "G", "M" };

        // Display original array
        Console.WriteLine("Original Array:");
        foreach (string g in arr)
        {
            Console.WriteLine(g);
        }

        Console.WriteLine("\nAfter Sort:");
      
        // Sorting the array
        Array.Sort(arr);

        // Display sorted array
        foreach (string g in arr)
        {
            Console.WriteLine(g);
        }

        Console.WriteLine("\nBinary Search for 'B':");
      
        // Binary Search for "B"
        int index = Array.BinarySearch(arr, "B");
        sortT(arr, index);

        Console.WriteLine("\nBinary Search for 'F':");
      
        // Binary Search for "F"
        index = Array.BinarySearch(arr, "F");
        sortT(arr, index);
    }

    public static void sortT<T>(T[] arr, int index)
    {
        // If the index is negative, it represents the 
        // bitwise complement of the next larger element
        if (index < 0)
        {
          
            // Convert to the actual index of 
            // the next larger element
            index = ~index;  

            if (index == 0)
                Console.WriteLine("Element would be inserted at the beginning of the array.");
            else
                Console.WriteLine($"Element would be inserted between {arr[index - 1]} and {arr[index]}.");
            
            if (index == arr.Length)
                Console.WriteLine("Element would be inserted at the end of the array.");
        }
        else
        {
            Console.WriteLine($"Element 'B' or 'F' found at index {index}.");
        }
    }
}

// C# program to demonstrate the use of the  
// Array.Sort<T>(T[], IComparer<T>) method 
using System;
using System.Collections.Generic;

public class GeeK : IComparer<string>
{
    public int Compare(string x, string y)
    {
        // Compare x and y in reverse order
        // Reverse the order by swapping x and y
        return y.CompareTo(x);  
    }
}

class Geeks
{  
    public static void Main()
    {
        // array elements
        string[] arr = new string[5] { "A", "D", "X", "G", "M" };

        foreach (string g in arr)
        {
            // display original array
            Console.WriteLine(g);
        }

        Console.WriteLine("\nAfter Sort: ");
        GeeK gg = new GeeK();

        // Sort<T>(T[], IComparer<T>) method
        Array.Sort(arr, gg);

        foreach (string g in arr)
        {
            // display sorted array
            Console.WriteLine(g);
        }

        Console.WriteLine("\nD Sorts between :");

        // binary Search for "D"
        int index = Array.BinarySearch(arr, "D");

        // call "sortT" function
        sortT(arr, index);

        Console.WriteLine("\nF Sorts between :");
        index = Array.BinarySearch(arr, "F");
        sortT(arr, index);
    }

    public static void sortT<T>(T[] arr, int index)
    {
        if (index < 0)
        {
            // If the index is negative,
            // it represents the bitwise
            // complement of the next
            // larger element in the array.
            index = ~index;

            Console.Write("Not found. Sorts between: ");

            if (index == 0)
                Console.Write("Beginning of array and ");
            else
                Console.Write("{0} and ", arr[index - 1]);

            if (index == arr.Length)
                Console.WriteLine("end of array.");
            else
                Console.WriteLine("{0}.", arr[index]);
        }
        else
        {
            Console.WriteLine("Found at index {0}.", index);
        }
    }
}

// C# program to demonstrate the use of 
// Array.Sort<T>(T[], Int32, Int32) method 
using System;
using System.Collections.Generic;

public class Geek : IComparer<string>
{
    public int Compare(string x, string y)
    {
        // Compare y and x in reverse order
        return y.CompareTo(x);
    }
}
public class Geeks
{
    
    public static void Main()
    {
        // Array elements
        string[] arr = { "AB", "CD", "GH", "EF", "MN", "IJ" };

        Console.WriteLine("Original Array :");
        Display(arr);

        Console.WriteLine("\nSort the array between index 1 to 4");
      
        // Array.Sort(T[], Int32, Int32) method
        // Sort will happen between index 1 to 4
        Array.Sort(arr, 1, 4);
        Display(arr);

        Console.WriteLine("\nSort the array reversely in between index 1 to 4");
      
        // Sort will happen between index 1 to 4 reversely
        Array.Sort(arr, 1, 4, new Geek());
        Display(arr);
    }

    public static void Display(string[] arr)
    {
        foreach (string g in arr)
        {
            Console.WriteLine(g);
        }
    }
}

// C# program to demonstrate the use of the 
// Array.Sort<T>(T[ ], Comparison<T>) Method 
using System; 
using System.Collections.Generic; 

class Geeks { 
	
	private static int CompareComp(string x, string y) 
	{ 
		// Handle null values first
		if (x == null && y == null) { 
          
			// If both x and y are null, they're equal
			return 0; 
		} else if (x == null) { 
          
			// If x is null but y is not, y is greater
			return 1; 
		} else if (y == null) { 
          
			// If y is null but x is not, x is greater
			return -1; 
		} else { 
          
			// Compare non-null values
			return string.Compare(x, y); 
		} 
	} 

	public static void Main() 
	{ 
		string[] arr = { "Java", "C++", "Scala", 
						"C", "Ruby", "Python" }; 
		
		Console.WriteLine("Original Array: "); 
		
		// display original array 
		Display(arr); 
		
		Console.WriteLine("\nSort with Comparison: "); 

		// Array.Sort<T>(T[], Comparison<T>) 
		// Method 
		Array.Sort(arr, CompareComp); 
		
		// display sorted array 
		Display(arr); 
		
	} 
	// Display function 
	public static void Display(string[] arr) 
	{ 
		foreach (string g in arr) 
		{ 
			Console.WriteLine(g); 
		} 
	} 
}