i named this sort "shnex sort". in comparison, shnex sort is better than bogosort. bogosort - O(n!) shnex sort - O(2^(n/e)) task 1 if i is greater than the length of the list, it moves to task 0. otherwise, it increments i and moves to task 2. task 2 if element i is equal to i, it moves to task 1. otherwise it sets j to i and moves to task 3. task 3 if element j is equal to j, it moves to task 2. otherwise, it swaps element j and element j+1 and increments j.
