A simple algorithm to speed up repeated summations! @NERDfirst
A simple algorithm to speed up repeated summations!  @NERDfirst
Uploaded July 2023 | Updated November 2026, 3 hours ago
Need to repeatedly sum up values from sublists which are extracted from a bigger list? You could simply loop through the values each time, but you'll find that doing so gets pretty slow. Today, we look at a simple pre-processing step that saves you a ton of trouble in the long run! Plus, we take a brief look at how this also works in bigger dimensions.

Want to see the code used in the video? Check out this repository: bitbucket.org/nerdfirst/quicksumalgorithm/src/master

-----

Want to contribute to the channel? Consider using the "Super Thanks" feature above, or visit my website at nerdfirst.net/donate to find alternative ways to donate. Thank you!

-----

Disclaimer: Please note that any information is provided on this channel in good faith, but I cannot guarantee 100% accuracy / correctness on all content. Contributors to this channel are not to be held responsible for any possible outcomes from your use of the information.
A simple algorithm to speed up repeated summations!Projector Keystoning - Friday Minis 235FTP for Notepad++ - Pinpoint #18Fast Inverse Square Root - Friday Minis 246How to Reason about RecursionPartial Application - Friday Minis 314Beware of this basic Python pitfall!Scanning with a Camera - Friday Minis 240WinDirStat - Pinpoint #15Optocouplers - Friday Minis 261Symbol-Based Markup - Friday Minis 245Static Members - Object Oriented Programming 05
0612 TV w/ NERDfirst |

A simple algorithm to speed up repeated summations!

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER