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

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch the explanation here : https://youtu.be/2HD41pYh8cU

    vector<int> quickSort(vector<int> arr) {
    vector<int> left, equal, right;
    for(int i = 0; i < arr.size(); i++){
        if(arr[i] < arr[0]) left.push_back(arr[i]);
        else if(arr[i] > arr[0]) right.push_back(arr[i]);
        else equal.push_back(arr[i]);
    }
    left.insert(left.end(), equal.begin(), equal.end());
    left.insert(left.end(), right.begin(), right.end());
    return left;
}