Wikipedia called these fencepost errors at one point (they now just say it is the specific type of off-by-one error in which you miscount the posts (vertices) or panels (arcs) in a fence (graph) by using one to count the other). I read this before my first programming class and then mentioned the term to my professor. She had no idea what I was talking about 😅
Actually, there’s 2 more:
IIRC the two hardest problems in computer science are cache invalidation, naming things, and off by one errors.
Pretty sure that’s the one
Wikipedia called these fencepost errors at one point (they now just say it is the specific type of off-by-one error in which you miscount the posts (vertices) or panels (arcs) in a fence (graph) by using one to count the other). I read this before my first programming class and then mentioned the term to my professor. She had no idea what I was talking about 😅