This isn't a best practice. The time is 0(n^2)

Well that's clever.

Hmm, this doesn't seem to pass.

One of the better 7kyus I've tackled here. Thank you to the author; a kikuyu I might add. Thanks Ken.

For sure, one of the better 7 kyus in here. Good job author!

Enjoyed playing around with this kata. Thank you to the author.

One of the better 7kyus in here.

Thanks. Fixed

Thank you I appreciate that.

I've described the array to be ascending. That should give the idea of a sorted list. But I've replaced the example.

Thank you I think I'll just add the arrays have unique numbers. But I'll update the tests to reflect that specific spec and intent to sort all pairs.

Ahh I see. Thank you for raising that. In that case, return the pair that has the first appearing number. It should be [-4, -1] since -4 appears first in the array. I hope that answers the second question you had.

Yes I perceived that would be an issue initially, so I had the test cases be unique arrays; in both random and fixed.