Comparison of fast summation algorithms

Vadim Stadnik

Rate me:

3.77/5 (6 votes)

25 Jan 2016CPOL21 min read

21K

205

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

Daily Counts

Downloads

Weekly Counts

License

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

Written By

Vadim Stadnik

Software Developer (Senior)

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.

Comparison of fast summation algorithms

Views

Downloads

License

Comments and Discussions