Homework 9 Sorting | C# Online Compiler

Homework 9 Sorting by Artur Mesrobyan

using System;

public class Program
{
  public static void Main(string[] args)
	{
		//Insertion();
		//Selection();
	  MergeSorting();
	 // QuickSorting();
  }
	
	static void Swap(ref int first, ref int second){
		int swapper = first;
		first = second;
		second = swapper;
	}

	static void BubbleSorting() {
		Console.WriteLine("Enter number of array's elements");
		int length =int.Parse(Console.ReadLine());
		int[] array = new int[length];
		Console.WriteLine("Enter array's elements");
		for (int i = 0; i < length; i++)
		{
			array[i] =int.Parse(Console.ReadLine());
		}

		Console.Write("Your array will be :  ");
		foreach (int arr in array) {
			Console.Write(arr + " ");
		}
		Console.WriteLine();

		for (int i = 0; i < length; i++) {
			for (int j = 0; j < length - 1; j++) {

				if (array[j] >= array[j + 1]) {
 					Swap(ref array[j], ref array[j+1]);
				}  
			}

		}
		Console.WriteLine();

		Console.Write("Bubble Sorted array is:  ");
		foreach (int arr in array)
		{
			Console.Write(arr + " ");
		}
	}

	static void Insertion() {

		Console.WriteLine("Enter number of array's elements");
		int length = int.Parse(Console.ReadLine());
		int[] array = new int[length];
		Console.WriteLine("Enter  array's elements");
		for (int i = 0; i < length; i++)
		{
			array[i] = int.Parse(Console.ReadLine());
		}

		Console.Write("Your array will be :  ");
		foreach (int arr in array)
		{
			Console.Write(arr + " ");
		}
		Console.WriteLine();


		for (int i = 0; i < length-1; i++) {

			for (int j = i+1; j > 0; j--) {
				if (array[j] < array[j-1]) {
					Swap(ref array[j] , ref array[j-1]);
				}              
			}
		}

		Console.Write("Insertion Sorted array is:  ");
		foreach (int arr in array)
		{
			Console.Write(arr + " ");
		}
	}

	static void Selection() {
		Console.WriteLine("Enter number of array's elements");
		int length = int.Parse(Console.ReadLine());
		int[] array = new int[length];
		Console.WriteLine("Enter  array's elements");
		for (int i = 0; i < length; i++)
		{
			array[i] = int.Parse(Console.ReadLine());
		}

		Console.Write("Your array will be :  ");
		foreach (int arr in array)
		{
			Console.Write(arr + " ");
		}
		Console.WriteLine();

		for (int i = 0; i < length; i++) {
			int minIndex = i;

			for (int j = i + 1; j < length; j++) {

				if (array[j] < array[minIndex]) {
					minIndex = j;              
				}
			}
			Swap( ref array[i], ref array[minIndex]);
		}
		
		Console.Write("Selection Sorted array is: ");
		foreach(int arr in array){
			Console.Write(arr + " ");
		}
	}
	
	//Merge Sorting

	static int[] Merge( int[] array){
		int length = array.Length;
		int ll = length / 2;
		int rl = length - ll;
		
		int[] leftSubArr = new int[ll];
		foreach (int arr in  leftSubArr)
		{
			Console.Write(arr + " ");
		}
		int[] rightSubArr = new int[rl];
		foreach (int arr in rightSubArr)
		{
			Console.Write(arr + " ");
		}
		
		if (ll > 1){
		 leftSubArr = Merge( leftSubArr);		
		}
		
		if(rl > 1){
		rightSubArr = Merge( rightSubArr);
		}
		
		return Sort( leftSubArr,  rightSubArr);				
	}
	
	static int[] Sort( int[] leftArr, int[] rightArr){
		int ll = leftArr.Length;
		int rl = rightArr.Length;
		bool condition = (ll >= rl);
		int? max = condition ? ll :  rl; 
		
		int[] sortedArr = new int[ll + rl];
		
		int r = 0;
		int l = 0;
		
			
		for( int i = 0; i < sortedArr.Length; i++){
			if(l != ll && r != rl ){
				if(leftArr[l] <= rightArr[r]){ 
					sortedArr[i] = leftArr[l];
					l++;
				} else {
					sortedArr[i] = rightArr[r];
					r++;
				}
			} else if(l == ll){
				sortedArr[i] = rightArr[r];
				r++;
			} else if(r == rl ){
				sortedArr[i] = leftArr[l];
				l++;
			}
		}
		
		return sortedArr;
	}

	static void MergeSorting(){
		Console.WriteLine("Enter number of array's elements");
		int length = int.Parse(Console.ReadLine());
		int[] array = new int[length];
		Console.WriteLine("Enter array's elements");
		for (int i = 0; i < length; i++)
		{
			array[i] = int.Parse(Console.ReadLine());
		}

		Console.Write("Your array is:  ");
		foreach (int arr in array)
		{
			Console.Write(arr + " ");
		}
		Console.WriteLine();
		
		int[] newarr =  Merge( array);
		
		Console.Write("Merge Sorted array is:  ");
		foreach (int arr in newarr )
		{
			Console.Write(arr + " ");
		}
	}
	
	//Quick Sorting
	
	static int PartitionByPivot(ref int[] array, int firstInd, int lastInd){
		
		int pivot = array[lastInd];
		int i = (firstInd - 1), j;
		for(j = 0; j < lastInd; j++){
			
			if(array[j] <= pivot){
				i++;
				Swap(ref array[i], ref array[j]);
				
			}
			
		}
		Swap(ref array[lastInd],ref array[i+1]);
		return i+1;
	}
	
	static void Quick(ref int[] arr, int first, int last){
		if(first < last){
			
			int pivotInd = PartitionByPivot(ref arr, first, last);
			
			Quick(ref arr, first, pivotInd-1);
			Quick(ref arr, pivotInd+1, last);
		}
	}
	
	static void QuickSorting(){
	Console.WriteLine("Enter number of array's elements");
		int length = int.Parse(Console.ReadLine());
		int[] array = new int[length];
		Console.WriteLine("Enter array's elements");
		for (int i = 0; i < length; i++)
		{
			array[i] = int.Parse(Console.ReadLine());
		}

		Console.Write("Your array is:  ");
		foreach (int arr in array)
		{
			Console.Write(arr + " ");
		}
		Console.WriteLine();
		
		Quick(ref array, 0, length-1);
		
		Console.Write("Quick Sorted array is:  ");
		foreach (int arr in array )
		{
			Console.Write(arr + " ");
		}
	}
	
}

​x
 
using System;
​
public class Program
{
  public static void Main(string[] args)
    {
        //Insertion();
        //Selection();
      MergeSorting();
     // QuickSorting();
  }
    
    static void Swap(ref int first, ref int second){
        int swapper = first;
        first = second;
        second = swapper;
    }
​
    static void BubbleSorting() {
        Console.WriteLine("Enter number of array's elements");
        int length =int.Parse(Console.ReadLine());
        int[] array = new int[length];
        Console.WriteLine("Enter array's elements");
        for (int i = 0; i < length; i++)
        {
            array[i] =int.Parse(Console.ReadLine());
        }
​
        Console.Write("Your array will be :  ");
        foreach (int arr in array) {
            Console.Write(arr + " ");
        }
        Console.WriteLine();
​
        for (int i = 0; i < length; i++) {
            for (int j = 0; j < length - 1; j++) {
​
                if (array[j] >= array[j + 1]) {
                    Swap(ref array[j], ref array[j+1]);
                }  
            }
​
        }
        Console.WriteLine();
​
        Console.Write("Bubble Sorted array is:  ");
        foreach (int arr in array)
        {
            Console.Write(arr + " ");
        }
    }
​
    static void Insertion() {
​
        Console.WriteLine("Enter number of array's elements");
        int length = int.Parse(Console.ReadLine());
        int[] array = new int[length];
        Console.WriteLine("Enter  array's elements");
        for (int i = 0; i < length; i++)
        {
            array[i] = int.Parse(Console.ReadLine());
        }
​
        Console.Write("Your array will be :  ");
        foreach (int arr in array)
        {
            Console.Write(arr + " ");
        }
        Console.WriteLine();
​
​
        for (int i = 0; i < length-1; i++) {
​
            for (int j = i+1; j > 0; j--) {
                if (array[j] < array[j-1]) {
                    Swap(ref array[j] , ref array[j-1]);
                }              
            }
        }
​
        Console.Write("Insertion Sorted array is:  ");
        foreach (int arr in array)
        {
            Console.Write(arr + " ");
        }
    }
​
    static void Selection() {
        Console.WriteLine("Enter number of array's elements");
        int length = int.Parse(Console.ReadLine());
        int[] array = new int[length];
        Console.WriteLine("Enter  array's elements");
        for (int i = 0; i < length; i++)
        {
            array[i] = int.Parse(Console.ReadLine());
        }
​
        Console.Write("Your array will be :  ");
        foreach (int arr in array)
        {
            Console.Write(arr + " ");
        }
        Console.WriteLine();
​
        for (int i = 0; i < length; i++) {
            int minIndex = i;
​
            for (int j = i + 1; j < length; j++) {
​
                if (array[j] < array[minIndex]) {
                    minIndex = j;              
                }
            }
            Swap( ref array[i], ref array[minIndex]);
        }
        
        Console.Write("Selection Sorted array is: ");
        foreach(int arr in array){
            Console.Write(arr + " ");
        }
    }
    
    //Merge Sorting
​
    static int[] Merge( int[] array){
        int length = array.Length;
        int ll = length / 2;
        int rl = length - ll;
        
        int[] leftSubArr = new int[ll];
        foreach (int arr in  leftSubArr)
        {
            Console.Write(arr + " ");
        }
        int[] rightSubArr = new int[rl];
        foreach (int arr in rightSubArr)
        {
            Console.Write(arr + " ");
        }
        
        if (ll > 1){
         leftSubArr = Merge( leftSubArr);       
        }
        
        if(rl > 1){
        rightSubArr = Merge( rightSubArr);
        }
        
        return Sort( leftSubArr,  rightSubArr);             
    }
    
    static int[] Sort( int[] leftArr, int[] rightArr){
        int ll = leftArr.Length;
        int rl = rightArr.Length;
        bool condition = (ll >= rl);
        int? max = condition ? ll :  rl; 
        
        int[] sortedArr = new int[ll + rl];
        
        int r = 0;
        int l = 0;
        
            
        for( int i = 0; i < sortedArr.Length; i++){
            if(l != ll && r != rl ){
                if(leftArr[l] <= rightArr[r]){ 
                    sortedArr[i] = leftArr[l];
                    l++;
                } else {
                    sortedArr[i] = rightArr[r];
                    r++;
                }
            } else if(l == ll){
                sortedArr[i] = rightArr[r];
                r++;
            } else if(r == rl ){
                sortedArr[i] = leftArr[l];
                l++;
            }
        }
        
        return sortedArr;
    }
​
    static void MergeSorting(){
        Console.WriteLine("Enter number of array's elements");
        int length = int.Parse(Console.ReadLine());
        int[] array = new int[length];
        Console.WriteLine("Enter array's elements");
        for (int i = 0; i < length; i++)
        {
            array[i] = int.Parse(Console.ReadLine());
        }
​
        Console.Write("Your array is:  ");
        foreach (int arr in array)
        {
            Console.Write(arr + " ");
        }
        Console.WriteLine();
        
        int[] newarr =  Merge( array);
        
        Console.Write("Merge Sorted array is:  ");
        foreach (int arr in newarr )
        {
            Console.Write(arr + " ");
        }
    }
    
    //Quick Sorting
    
    static int PartitionByPivot(ref int[] array, int firstInd, int lastInd){
        
        int pivot = array[lastInd];
        int i = (firstInd - 1), j;
        for(j = 0; j < lastInd; j++){
            
            if(array[j] <= pivot){
                i++;
                Swap(ref array[i], ref array[j]);
                
            }
            
        }
        Swap(ref array[lastInd],ref array[i+1]);
        return i+1;
    }
    
    static void Quick(ref int[] arr, int first, int last){
        if(first < last){
            
            int pivotInd = PartitionByPivot(ref arr, first, last);
            
            Quick(ref arr, first, pivotInd-1);
            Quick(ref arr, pivotInd+1, last);
        }
    }
    
    static void QuickSorting(){
    Console.WriteLine("Enter number of array's elements");
        int length = int.Parse(Console.ReadLine());
        int[] array = new int[length];
        Console.WriteLine("Enter array's elements");
        for (int i = 0; i < length; i++)
        {
            array[i] = int.Parse(Console.ReadLine());
        }
​
        Console.Write("Your array is:  ");
        foreach (int arr in array)
        {
            Console.Write(arr + " ");
        }
        Console.WriteLine();
        
        Quick(ref array, 0, length-1);
        
        Console.Write("Quick Sorted array is:  ");
        foreach (int arr in array )
        {
            Console.Write(arr + " ");
        }
    }
    
}
​

View IL Code