Sorting algorithms/Quicksort: Difference between revisions
Content deleted Content added
Added Java version |
m →{{header|Java}}: Added comment about pivot value |
||
Line 238:
LinkedList<Integer> more= new LinkedList<Integer>();
if(arr.size() <= 1) return arr;
int pivot= arr.getFirst(); //This pivot can change to get faster results
for(int i: arr){
if(i < pivot)
Line 253:
return less;
}</java>
=={{header|Joy}}==
| |||