[JAVA] 퀵소팅(QuickSorting)

class QuickSorting{

  static int[] elements = {3,44,38,5,47,15,36,26,27,2,46,4,19,50,48};

  public static void main(String[] args) throws Exception {
    quickSort(0, elements.length - 1);
    printElement();
   }

   static void quickSort(int startIndex, int endIndex) {
     if ((endIndex - startIndex) <= 0) {
       return;
     }
    int pivotIndex = startIndex;
    int storeIndex = pivotIndex + 1;

    for (int i = pivotIndex + 1; i <= endIndex; i++) {
      if (elements[i] < elements[pivotIndex]) {
        swapIndex(i, storeIndex);
        storeIndex++;
      }
    }
    swapIndex(pivotIndex, storeIndex - 1);
    quickSort(startIndex, storeIndex - 2);
    quickSort(storeIndex, endIndex);
   }

   static void swapIndex(int foreIndex, int backIndex) {
     if (foreIndex == backIndex) {
       return;
     }
     int tmpValue = elements[foreIndex];
     elements[foreIndex] = elements[backIndex];
     elements[backIndex] = tmpValue;
   }

   static void printElement() {
     for (int element : elements) {
       System.out.printf("%d ", element);
     }
     System.out.println();
   }

}