update

Task/Sorting-algorithms-Quicksort/Java/sorting-algorithms-quicksort.java

@@ -1,7 +1,7 @@
 public static <E extends Comparable<? super E>> List<E> quickSort(List<E> arr) {
-    if (arr.size() <= 1)
-        return arr;
-    E pivot = arr.getFirst(); //This pivot can change to get faster results
+if (!arr.isEmpty()) {
+    E pivot = arr.get(0); //This pivot can change to get faster results
+
 
     List<E> less = new LinkedList<E>();
     List<E> pivotList = new LinkedList<E>();
@@ -25,4 +25,7 @@ public static <E extends Comparable<? super E>> List<E> quickSort(List<E> arr) {
     less.addAll(pivotList);
     less.addAll(more);
     return less;
+ }
+return arr;
+
 }