This repository presents an algorithm that avoids the traversing(loop) of a bidimensional array based on a logical representation for each element on the 2D Array. This approach turns the computing cost from O(n²) to O(1) complexity, where we end up having a constant-time response in our application. The formula is being tested by several Unit Tests focusing on exercising the multiple variants of a matrix and their possible selections.
