Anonymous user
Sorting algorithms/Quicksort: Difference between revisions
Added Java version
(Ada - It fails with two elements arrays) |
(Added Java version) |
||
Line 229:
To actually sort data in J, it is more convenient and more efficient to use<tt> /:~ </tt>.
=={{header|Java}}==
{{works with|Java|1.5+}}
{{trans|Python}}
<java>public static LinkedList<Integer> quickSort(LinkedList<Integer> arr){
LinkedList<Integer> less= new LinkedList<Integer>();
LinkedList<Integer> pivotList= new LinkedList<Integer>();
LinkedList<Integer> more= new LinkedList<Integer>();
if(arr.size() <= 1) return arr;
int pivot= arr.getFirst();
for(int i: arr){
if(i < pivot)
less.add(i);
else if(i > pivot)
more.add(i);
else
pivotList.add(i);
}
less= quickSort(less);
more= quickSort(more);
less.addAll(pivotList);
less.addAll(more);
return less;
}</java>
=={{header|Joy}}==
| |||