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

Showing content from https://TheAlgorithms.github.io/C-Plus-Plus/d6/d1a/dnf__sort_8cpp_source.html below:

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

std::vector<T>

(

std::vector<T> &in_arr) {

std::vector<T> arr(in_arr);

uint64_t hi = arr.size() - 1;

std::swap(arr[lo++], arr[mid++]);

std::swap(arr[mid], arr[hi--]);

std::vector<uint64_t> array1 = {0, 1, 1, 2};

std::cout <<

;

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

std::cout <<

<< std::endl;

std::vector<uint64_t> array2 = {1, 0, 0, 1, 1, 0, 2, 1};

std::cout <<

;

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

std::cout <<

<< std::endl;

std::vector<uint64_t> array3 = {1, 1, 0, 0, 1, 2, 2, 0, 2, 1};

std::cout <<

;

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

std::cout <<

<< std::endl;

std::vector<uint64_t> array4 = {2, 2, 2, 0, 0, 1, 1};

std::cout <<

;

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

std::cout <<

<< std::endl;

std::vector< T > dnfSort(const std::vector< T > &in_arr)

The main function implements DNF sort.

static void test()

Self-test implementations.

int main()

Main function.

Functions for the DNF sort implementation.

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