package Sorts;

import static Sorts.SortUtils.*;

/**
 * @author Varun Upadhyay (https://github.com/varunu28)
 * @author Podshivalov Nikita (https://github.com/nikitap492)
 * @see SortAlgorithm
 */
class QuickSort implements SortAlgorithm {

  /**
   * This method implements the Generic Quick Sort
   *
   * @param array The array to be sorted Sorts the array in increasing order
   */
  @Override
  public  T[] sort(T[] array) {
    doSort(array, 0, array.length - 1);
    return array;
  }

  /**
   * The sorting process
   *
   * @param left The first index of an array
   * @param right The last index of an array
   * @param array The array to be sorted
   */
  private static  void doSort(T[] array, int left, int right) {
    if (left < right) {
      int pivot = randomPartition(array, left, right);
      doSort(array, left, pivot - 1);
      doSort(array, pivot, right);
    }
  }

  /**
   * Ramdomize the array to avoid the basically ordered sequences
   *
   * @param array The array to be sorted
   * @param left The first index of an array
   * @param right The last index of an array
   * @return the partition index of the array
   */
  private static  int randomPartition(T[] array, int left, int right) {
    int randomIndex = left + (int) (Math.random() * (right - left + 1));
    swap(array, randomIndex, right);
    return partition(array, left, right);
  }

  /**
   * This method finds the partition index for an array
   *
   * @param array The array to be sorted
   * @param left The first index of an array
   * @param right The last index of an array Finds the partition index of an array
   */
  private static  int partition(T[] array, int left, int right) {
    int mid = (left + right) >>> 1;
    T pivot = array[mid];

    while (left  a	b	c	d	e
    print(stringArray);
  }
}