We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Sorting
  4. Quicksort 1 - Partition
  5. Discussions

Quicksort 1 - Partition

  • dorirgob
     + 0 comments

    Java:

    public static List<Integer> quickSort(List<Integer> arr) {
  // Write your code here
  int pivot = arr.get(0);
  List<Integer> left = new ArrayList<>();
  List<Integer> right = new ArrayList<>();
  for (Integer i : arr) {
    if (i < pivot) {
      left.add(i);
    } else if (i > pivot) {
      right.add(i);
    }
  }
  left.add(pivot);
  left.addAll(right);
  return left;
}