Click here to Skip to main content
15,300,338 members
Articles / General Programming / Algorithms

Tagged as

Stats

18.1K views
202 downloads
18 bookmarked

Comparison of fast summation algorithms

Rate me:
Please Sign up or sign in to vote.
3.77/5 (6 votes)
25 Jan 2016CPOL21 min read
This article explains fast sequential summation algorithms through the comparison of two representations of a binary tree: a linked structure of nodes and an array.

Views

Downloads

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

Vadim Stadnik
Software Developer (Senior)
Australia Australia
Vadim Stadnik has many years of experience of the development of innovative software products. He is the author of the book “Practical Algorithms on Large Datasets”, available on Amazon. His interests include computational mathematics, advanced data structures and algorithms, artificial intelligence and scientific programming.

Comments and Discussions