Language
C++
Compiler
gcc 13.2.0
Options
Boost 1.83.0
C++2b(GNU)
no pedantic
$ g++ prog.cc -I/opt/wandbox/boost-1.83.0-gcc-13.2.0/include -std=gnu++2b sort ([5, 4, 2, 3, 1].begin(), [5, 4, 2, 3, 1].end())
Return: [1, 2, 3, 4, 5]
sort ([1, 3, 5, 2, 4].begin(), [1, 3, 5, 2, 4].end(), greater<int>())
Return: [5, 4, 3, 2, 1]
stable_sort ([5, 3, 1, 4, 2].begin(), [5, 3, 1, 4, 2].end())
Return: [1, 2, 3, 4, 5]
stable_sort ([2, 5, 1, 4, 3].begin(), [2, 5, 1, 4, 3].end(), greater<int>())
Return: [5, 4, 3, 2, 1]
partial_sort ([2, 1, 4, 3, 5].begin(), [2, 1, 4, 3, 5].begin()+3, [2, 1, 4, 3, 5].end())
Return: [1, 2, 3, 4, 5]
partial_sort ([1, 2, 3, 4, 5].begin(), [1, 2, 3, 4, 5].begin()+3, [1, 2, 3, 4, 5].end(), greater<int>())
Return: [5, 4, 3, 1, 2]
partial_sort_copy ([2, 1, 4, 5, 3].begin(), [2, 1, 4, 5, 3].end(), [0, 0, 0].begin(), [0, 0, 0].end())
Return: [1, 2, 3]
partial_sort_copy ([1, 4, 5, 3, 2].begin(), [1, 4, 5, 3, 2].end(), [0, 0, 0].begin(), [0, 0, 0].end(), greater<int>())
Return: [5, 4, 3]
is_sorted ([3, 4, 5, 1, 2].begin(), [3, 4, 5, 1, 2].end())
Return: false
is_sorted ([1, 2, 3, 4, 5].begin(), [1, 2, 3, 4, 5].end())
Return: true
is_sorted ([1, 3, 5, 4, 2].begin(), [1, 3, 5, 4, 2].end(), greater<int>())
Return: false
is_sorted ([5, 4, 3, 2, 1].begin(), [5, 4, 3, 2, 1].end(), greater<int>())
Return: true
is_sorted_until ([1, 2, 3, 4, 5].begin(), [1, 2, 3, 4, 5].end())
Return: [1, 2, 3, 4, 5].end()
is_sorted_until ([5, 4, 3, 1, 2].begin(), [5, 4, 3, 1, 2].end(), greater<int>())
Return: [5, 4, 3, 1, X].begin()+4
nth_element ([3, 5, 1, 2, 4].begin(), [3, 5, 1, 2, 4].begin()+3, [3, 5, 1, 2, 4].end())
Return: [2, 1, 3, 4, 5]
nth_element ([4, 2, 3, 5, 1].begin(), [4, 2, 3, 5, 1].begin()+3, [4, 2, 3, 5, 1].end(), greater<int>())
Return: [4, 5, 3, 2, 1]
Exit Code:
0