sortednumbers

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

namespace activity3
{
    class Program
    {
        static void Main(string[] args)
        {
            //int[] numbers = { 5, 55,10, 60,40, 100, 25, 30,80, 90 };
            int[] numbers = new int[10];
            Random r = new Random();
            for (int index = 0; index <= numbers.Length - 1; index++)
                numbers[index] = r.Next(1, 100);

            Console.WriteLine("Sorted numbers:");

            int length =10;
            quickSort(numbers, 0, length - 1);

            for (int i = 0; i < 10; i++)

                Console.Write(numbers[i] + "\t");
            Console.WriteLine();
        }

        static void quickSort(int[] numbers, int left, int right)
        {

            int i = left, j = right;

            int temp;

            int pivot = numbers[(left + right) / 2];

            /* partition */

            while (i <= j)
            {

                while (numbers[i] < pivot)

                    i++;

                while (numbers[j] > pivot)

                    j--;

                if (i <= j)
                {

                    temp = numbers[i];

                    numbers[i] = numbers[j];

                    numbers[j] = temp;

                    i++;

                    j--;

                }

            };






      //* recursion */

            if (left < j)

                quickSort(numbers, left, j);

            if (i < right)

                quickSort(numbers, i, right);


    }
    }
}