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

  • lokeshnogia27
     + 1 comment

    All test case Passed Java Solution using List

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

    }