Three solutions to Maximum Subsequence Sum Problem

Maximum Subsequence Sum Problem (a.k.a. Maximum Subarray Sum Problem) is a polynomial-time problem that has an optimal quasilinear time complexity; i.e. O(n log n) Introduction to Max Subarray Sum (0:00) Cubic Solution (4:12) Quadratic Solution (10:00) Quasilinear Solution (12:37)