title: Quick Sort, sort in Descending order, instead of Ascending
body: <p>i have written a Quick Sort Algorithm and it sorts the array in ascending order. I am trying to alter the program so it sorts the array in descending order. Sounds simple enough, but i'm not sure which areas of the program to alter. Thanks. </p>
  
  <pre><code>public static void Quick_Sort(ref double[] data, int left,int right, ref int count)
      {
          int i;      
          int j;      
          double pivot;      
          double temp;        
          i = left;      
          j = right;     
          pivot = data[(left + right) / 2];                 
              do         
              {
                  while ((data[i] &lt; pivot) &amp;&amp; (i &lt; right)) i++;       
                  count++;
                  while ((pivot &lt; data[j]) &amp;&amp; (j &gt; left)) j--;        
                  count++;
                  ;
                  if (i &lt;= j)     
                  {
                      temp = data[i];     
                      data[i] = data[j];    
                      data[j] = temp;     
                      i++;        
                      j--;       
                      count++;
                  }
              } while (i &lt;= j);       
              if (left &lt; j) Quick_Sort(ref data, left, j, ref count, order);     
              if (i &lt; right) Quick_Sort(ref data, i, right, ref count, order);
  }    
  
  
  
   public static void QuickSort(ref double[] data, int size, int order)
      {
  
          int count = 0;      
          Quick_Sort(ref data, 0, data.Length - 1, ref count, order);    
          Console.WriteLine("\n    Quick Sort\n    Number of Elements: {0}\n    Executed {1} times\n\n    Worse-Case: O(n^2)\n    Best-Case: O(n log n)\n    Average-Case: O(n log n)",size,  count);     
      }
  </code></pre>