TheAlgorithms-C-Plus-Plus/sorting/gnome_sort.cpp

#include <iostream>

void gnomesort(int arr[], int size) {
    // few easy cases
    if (size <= 1) return;

    int index = 0;  // initialize some variables.
    while (index < size) {
        // check for swap
        if ((index == 0) || (arr[index] >= arr[index - 1])) {
            index++;
        } else {
            std::swap(arr[index], arr[index - 1]);  // swap
            index--;
        }
    }
}

// Our main function
int main() {
    int arr[] = {-22, 100, 150, 35, -10, 99};
    int size = sizeof(arr) / sizeof(arr[0]);

    gnomesort(arr, size);

    for (int i = 0; i < size; i++) printf("%d ", arr[i]);

    return 0;
}