I read far enough into that to see the code that could cause overflow and quit reading. I've programmed various cases of binary search, merge sort, etc. for de

I read far enough into that to see the code that could cause overflow and quit reading. I've programmed various cases of binary search, merge sort, etc. for decades and in all cases wrote code with indexing that could never overflow. If some silly academic make-work, prof-scam, busy-work, nonsense code could overflow, so be it. Heck, I even worry ahout do i = 1 to n wondering if the code is written to exit the loop when i = n + 1 tests larger than n, which in case n is the largest integer could never happen. The title here "nearly all" is to me total BS. Take your insult of my code and stuff it. Capiche?