{"version":"1.0","type":"rich","title":"Gist 9ef6442a63b8d2372fbf0c08916bdb88","description":"This visualization compares four JavaScript implementations of the maximum subarray problem in a single file, using plain arrays and arithmetic operations. The code defines `maxSubArray01` through `maxSubArray04`, each with distinct algorithmic strategies: brute-force nested loops, greedy accumulation with `Math.max`, dynamic programming with an auxiliary array, and an in-place DP variant that mutates the input. No external visualization libraries are used; the example relies solely on standard JavaScript array methods and `Math.max` to illustrate trade-offs between time and space complexity. The gist serves as a code-level comparison rather than a graphical chart.","provider_name":"VizHub AI Studio","provider_url":"https://next.vizhub.com","html":"<iframe src=\"https://next.vizhub.com/viz/gist-9ef6442a63b8d2372fbf0c08916bdb88?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"1\"></iframe>","width":960,"height":500,"cache_age":3600}