C++ Gnome sort algorithm Exercise: Sort an array of elements using the Gnome sort algorithm

C++ Sorting: Exercise-7 with Solution

Write a C++ program to sort an array of elements using the Gnome sort algorithm.

Sample Solution:

C++ Code :

// Including necessary C++ libraries
#include <algorithm>
#include <iterator>
#include <iostream>

// Function to perform gnome sort algorithm
template<typename RandomAccessIterator>
void gnome_sort(RandomAccessIterator begin, RandomAccessIterator end) {
  // Initializing iterators i and j
  auto i = begin + 1;
  auto j = begin + 2;

  // Gnome Sort algorithm
  while (i < end) {
    // If the current element is greater than or equal to the previous element
    if (!(*i < *(i - 1))) {
      // Move to the next pair of elements
      i = j;
      ++j;
    } else {
      // Swap elements and move backward
      std::iter_swap(i - 1, i);
      --i;
      // If the beginning of the range is reached, move to the next pair of elements
      if (i == begin) {
        i = j;
        ++j;
      }
    }
  }
}

// Main function
int main() {
  // Initializing an array of integers for sorting
  int a[] = {125, 0, 695, 3, -256, -5, 214, 44, 55};

  // Displaying the original numbers in the array
  std::cout << "Original numbers:\n";
  std::copy(std::begin(a), std::end(a), std::ostream_iterator<int>(std::cout, " "));
  std::cout << "\n";

  // Sorting the array using gnome_sort function
  gnome_sort(std::begin(a), std::end(a));

  // Displaying the sorted numbers after gnome sort
  std::cout << "Sorted numbers:\n";
  std::copy(std::begin(a), std::end(a), std::ostream_iterator<int>(std::cout, " "));
  std::cout << "\n";

  // Returning 0 to indicate successful execution
  return 0;
}

Sample Output:

Original numbers:
125 0 695 3 -256 -5 214 44 55 
Sorted numbers:
-256 -5 0 3 44 55 125 214 695 

Flowchart:

C++ Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a C++ program to sort an array of elements using the Counting sort algorithm.
Next: Write a C++ program to sort an array of elements using the Heapsort sort algorithm.