You are viewing a single comment's thread. Return to all comments →
Keeping it as simple as possible
static void partition(int[] ar) { int pivot = ar[0]; ArrayList<Integer> left = new ArrayList<Integer>(); ArrayList<Integer> equal = new ArrayList<Integer>(); ArrayList<Integer> right = new ArrayList<Integer>(); equal.add(pivot); for (int i = 1; i < ar.length; i++) { if (ar[i] < pivot) left.add(ar[i]); else if (ar[i] == pivot) equal.add(ar[i]); else right.add(ar[i]); } for(int i=0;i<left.size();i++) System.out.print(left.get(i)+" "); for(int i=0;i<equal.size();i++) System.out.print(equal.get(i)+" "); for(int i=0;i<right.size();i++) System.out.print(right.get(i)+" ");
Seems like cookies are disabled on this browser, please enable them to open this website
Quicksort 1 - Partition
You are viewing a single comment's thread. Return to all comments →
Keeping it as simple as possible