@@ -0,0 +1,1172 @@
+package algorithms.sorting;%0D%0A%0D%0Aimport org.junit.*;%0D%0A%0D%0Aimport java.util.Arrays;%0D%0A%0D%0Aimport static org.junit.Assert.*;%0D%0A%0D%0Apublic class QuickSortTest %7B%0D%0A%0D%0A  @Test%0D%0A  public void testSort1ElementArray() %7B%0D%0A    int%5B%5D arr = new int%5B%5D%7B1%7D;%0D%0A    int%5B%5D res = QuickSort.sort(arr);%0D%0A    assertArrayEquals(arr, res);%0D%0A  %7D%0D%0A%0D%0A  @Test%0D%0A  public void testSortOrdered() %7B%0D%0A    int%5B%5D arr = new int%5B%5D%7B1,3,5,15,1235,12389%7D;%0D%0A    int%5B%5D res = QuickSort.sort(arr);%0D%0A    assertArrayEquals(arr, res);%0D%0A  %7D%0D%0A%0D%0A  @Test%0D%0A  public void testSortShortArray() %7B%0D%0A    int%5B%5D arr = new int%5B%5D%7B5,1,981,5,123%7D;%0D%0A    int%5B%5D res = QuickSort.sort(arr);%0D%0A    int%5B%5D expected = returnSortedCopyOf(arr);%0D%0A    assertArrayEquals(expected, res);%0D%0A  %7D%0D%0A  @Test%0D%0A  public void testSortLongArray() %7B%0D%0A    int%5B%5D arr = new int%5B%5D%7B5,1,981,5,123,9013,5192,321,412,51,5,23,5,6,12,17,86,53%7D;%0D%0A    int%5B%5D res = QuickSort.sort(arr);%0D%0A    int%5B%5D expected = returnSortedCopyOf(arr);%0D%0A    assertArrayEquals(expected, res);%0D%0A  %7D%0D%0A%0D%0A  private int%5B%5D returnSortedCopyOf(int%5B%5D original) %7B%0D%0A    int%5B%5D copy = new int%5Boriginal.length%5D;%0D%0A    System.arraycopy(original, 0, copy, 0, original.length);%0D%0A    Arrays.sort(copy);%0D%0A    return copy;%0D%0A  %7D%0D%0A%7D

Add quicksort test