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

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

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

(std::vector<T> &arr,

start,

end) {

(start <= end) {

arr[start] = arr[end];

(

i = size; i > 1; --i) {

max_index = 0, j = 0;

(j = 0; j < i; j++) {

(arr[j] >= max_value) {

(max_index != i - 1)

std::cout <<

;

std::vector<int> arr1 = {23, 10, 20, 11, 12, 6, 7};

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

std::cout <<

;

(

i = 0; i < size1; i++) {

std::cout << arr1[i] <<

;

std::cout << std::endl;

std::cout <<

;

std::vector<double> arr2 = {23.56, 10.62, 200.78, 111.484,

3.9, 1.2, 61.77, 79.6};

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

std::cout <<

;

(

i = 0; i < size2; i++) {

std::cout << arr2[i] <<

;

std::cout << std::endl;

std::cout <<

;

std::vector<float> arr3 = {6.56, 12.62, 200.78, 768.484, 19.27, 68.87, 9.6};

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

std::cout <<

;

(

i = 0; i < size3; i++) {

std::cout << arr3[i] <<

;

std::cout << std::endl;

Functions for Pancake sort algorithm.

void reverse(std::vector< T > &arr, int start, int end)

This implementation is for reversing elements in a a C-style array .

static void test()

Test implementations.

int pancakeSort(std::vector< T > &arr, int size)

This implementation is for a C-style array input that gets modified in place.

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