Sorting algorithms/Quicksort: Difference between revisions

Content added Content deleted
(→‎{{header|Java}}: Now works with all Comparable types)
Line 233:
{{trans|Python}}
 
<java>public static <E extends Comparable<E>> LinkedList<IntegerE> quickSort(LinkedList<IntegerE> arr){
LinkedList<IntegerE> less= new LinkedList<IntegerE>();
LinkedList<IntegerE> pivotList= new LinkedList<IntegerE>();
LinkedList<IntegerE> more= new LinkedList<IntegerE>();
if(arr.size() <= 1) return arr;
intE pivot= arr.getFirst(); //This pivot can change to get faster results
for(intE i: arr){
if(i < .compareTo(pivot)<0)
less.add(i);
else if(i > .compareTo(pivot)>0)
more.add(i);
else
Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Quicksort"