FInds a 'strand' (an increasing section) and then merges it with the previous strand. Best Case: O(n) Worst Case: O(n^2)
