I recall the Programming Pearls article from the Sept. 1984 issue of the Communications of the ACM journal, which compared various algorithms to determine the m

I recall the Programming Pearls article from the Sept. 1984 issue of the Communications of the ACM journal, which compared various algorithms to determine the max sum of a continuous subarray of an array. The article showed how a linear, O(N), algorithm running on a lowly 8-bit CPU can beat a cubic algorithm, O(N^3), running on a Cray supercomputer, when N is sufficiently large. see https://www.cs.rpi.edu/~moorthy/Courses/CSCI2300/p865-bentley.pdf https://www.cs.rpi.edu/~moorthy/Courses/CSCI2300/p865-bentle...