Counting the number of rectangles in an M by N grid
Jenq-Foung JF Yao · Journal of computing sciences in colleges · 2013
This paper presents a mathematics problem that involves counting the rectangle total in an M by N grid, for which the correctness of the solution will also be proven mathematically. This paper presents two approaches, including one designed with a non-mathematical audience in mind. The results show that the non-mathematical approach has been received well by undergraduate computer science students. Algorithms for both approaches are presented and analyzed. Courses that could use this example are suggested as well.