Closed. This question is opinion-based. It is not currently accepting answers. Want to improve this question? Update the question so it can be answered with facts and citations by editing this post. Closed 2 years ago. Improve this question I want to convert this into a more readable for other programmers in the team, but I am not sure how
Tag: refactoring
Snail Algorithm – controlling Max/Min position for traversal
I’m working on a problem in CodeWars for fun, and I’m having trouble with a couple of things: Understanding where I need to modify the code in order to properly control the “turning point” of m and n so that they begin decreasing rather than increasing. Refactoring this code appropriately. The purpose of the algorithm is to traverse a 2D