New Sort：Hyper Stooge Sort

[pystraf]

The hyper stooge sorting is a sorting algorithm that worse than the stooge sorting. Instead of recursing using two-thirds of the array, it is modified to n - 1. It achieves a time complexity of O(3^n), It's very very bad! So I set the unreasonable limit to 20. (This algortihm is proposed by fungamer2)