# C++ Program for Stooge Sort

• Last Updated : 12 Jan, 2018

The Stooge sort is a recursive sorting algorithm. It is defined as below (for ascending order sorting).

```Step 1 : If value at index 0 is greater than
value at last index, swap them.
Step 2:  Recursively,
a) Stooge sort the initial 2/3rd of the array.
b) Stooge sort the last 2/3rd of the array.
c) Stooge sort the initial 2/3rd again to confirm.
```

## C++

 `// C++ code to implement stooge sort``#include ``using` `namespace` `std;` `// Function to implement stooge sort``void` `stoogesort(``int` `arr[],``int` `l, ``int` `h)``{``    ``if` `(l >= h)``      ``return``;` `    ``// If first element is smaller than last,``    ``// swap them``    ``if` `(arr[l] > arr[h])``       ``swap(arr[l], arr[h]);` `    ``// If there are more than 2 elements in``    ``// the array``    ``if``(h-l+1>2)``    ``{``        ``int` `t = (h-l+1)/3;` `        ``// Recursively sort first 2/3 elements``        ``stoogesort(arr, l, h-t);` `        ``// Recursively sort last 2/3 elements``        ``stoogesort(arr, l+t, h);` `        ``// Recursively sort first 2/3 elements``        ``// again to confirm``        ``stoogesort(arr, l, h-t);``    ``}``}` `// Driver Code``int` `main()``{``    ``int` `arr[] = {2, 4, 5, 3, 1};``    ``int` `n = ``sizeof``(arr)/``sizeof``(arr[0]);` `    ``// Calling Stooge Sort function to sort``    ``// the array``    ``stoogesort(arr, 0, n-1);` `    ``// Display the sorted array``    ``for` `(``int` `i=0; i

Output:

```1 2 3 4 5
```

Please refer complete article on Stooge Sort for more details!

My Personal Notes arrow_drop_up