@@ -0,0 +1,657 @@
+import org.junit.Test;%0Aimport java.util.Arrays;%0A%0Apublic class QuickSortTest %7B%0A%0A    @Test%0A    public void test() %7B%0A        int list%5B%5D = %7B -5, 8, 0, 12, 55, 1, -66, 35, 3 %7D;%0A        int listLength = list.length;%0A        QuickSort quickSort = new QuickSort();%0A        quickSort.sort(list, 0, listLength-1);%0A        for (int i = 0; i %3C list.length - 1; i++) %7B%0A            assert (list%5Bi%5D %3C= list%5Bi + 1%5D);%0A        %7D%0A    %7D%0A%0A    @Test%0A    public void nullList()%7B%0A        int list%5B%5D = %7B%7D;%0A        int expectedList%5B%5D = %7B%7D;%0A        QuickSort quickSort = new QuickSort();%0A        quickSort.sort(list, 0, 0);%0A        assert (Arrays.equals(list, expectedList));%0A    %7D%0A%7D%0A

Add quick sort test for Java implementation