using System;

public class Program

{

​

    public static void Main()

    {

        Random rnd = new Random();

          int [] arr=new int[100] ;

            for (int i = 0; i < arr.Length; i++) 

                {

                                 arr[i] = rnd.Next(1,1000000);

​

                }   

​

         int [] bSortArry=new int[100] ;

                 int [] hSortArry=new int[100] ;

                        foreach (int res in arr)

{

  Console.WriteLine(" " + res + " ");

}

    bSortArry=  bubleSort(arr);

                                foreach (int res in bSortArry)

{

  Console.WriteLine(" " + res + " ");

}

    hSortArry=   heapSort(arr, 100);

​

                                        foreach (int res in hSortArry)

{

  Console.WriteLine(" " + res + " ");

}

​

​

    }

    public static int[] bubleSort (int[] arr){

    int temp;

      for (int j = 0; j <= arr.Length - 2; j++) {

            for (int i = 0; i <= arr.Length - 2; i++) {

               if (arr[i] > arr[i + 1]) {

                  temp= arr[i + 1];

                  arr[i + 1] = arr[i];

                  arr[i] = temp;

               }

            }

         }

        return arr;

    }

    public  static int[] heapSort(int[] arr, int n) {

         for (int i = n / 2 - 1; i >= 0; i--)

         heapify(arr, n, i);

         for (int i = n-1; i>=0; i--) {

            int temp = arr[0];

            arr[0] = arr[i];

            arr[i] = temp;

            heapify(arr, i, 0);

         }

      return arr;

      }

  public    static void heapify(int[] arr, int n, int i) {

         int largest = i;

         int left = 2*i + 1;

         int right = 2*i + 2;

         if (left < n && arr[left] > arr[largest])

         largest = left;

         if (right < n && arr[right] > arr[largest])

         largest = right;

         if (largest != i) {

            int swap = arr[i];

            arr[i] = arr[largest];

            arr[largest] = swap;

            heapify(arr, n, largest);

         }

      }

​

}

​

​