Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://TheAlgorithms.github.io/C-Plus-Plus/d3/d22/quick__sort__iterative_8cpp_source.html below:

TheAlgorithms/C++: sorting/quick_sort_iterative.cpp Source File

(std::vector<int> &arr,

start,

end)

index = start - 1;

(

j = start; j < end; j++) {

(arr[j] <= pivot) {

std::swap(arr[++index], arr[j]);

std::swap(arr[index + 1], arr[end]);

std::stack<int>

;

end = arr.size()-1;

(!

.empty())

pivotIndex =

(arr,start,end);

(pivotIndex -1 > start)

std::vector<int> case1={100,534,1000000,553,10,61,2000,238,2756,9,12,56,30};

std::cout<<

;

std::cout<<

;

(

x : case1) std::cout<<x<<

;

assert(std::is_sorted(std::begin(case1),std::end(case1)));

std::cout<<

;

std::cout<<

;

(

x : case1) std::cout<<x<<

;

std::vector<int> case2={-10,-2,-5,-2,-3746,-785,-123, -452, -32456};

std::cout<<

;

std::cout<<

;

(

x : case2) std::cout<<x<<

;

assert(std::is_sorted(std::begin(case2),std::end(case2)));

std::cout<<

;

std::cout<<

;

(

x : case2) std::cout<<x<<

;

for std::invalid_argument

void push(const value_type &item)

void iterativeQuickSort(std::vector< int > &arr)

The main sorting function.

int partition(std::vector< int > &arr, int start, int end)

The partition function sorts the array from start to end and uses the last element as the pivot.

void tests()

Self-test implementations.

int main()

Main function.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4