class QuickSorting
    { public static void sorting1(double[] arr, int first, int last;)
        double p = arr[(last - first) / 2 + first];
        int i = first, j = last;
        while (i<=j)
            {while (arr[i]<p && i<=last;i++)
                while(arr[j]<p && j>=first;j--)
                    if (i<> j)
                        {
                          double temp = arr[i];
                          arr[i]=arr[j];
                          arr[j]=temp;
                          i++;
                          j--;
                        }
                if (j>first)
                    sorting1(arr, first, j);
                if (i<last)
                    sorting (arr,i,last);
     }