After puzzling as to what to add to the Fibonacci program for a few days, I hit upon the idea to implement sort.h with templates galore.

As a result I have lots of work to implement a huge raft of algorithms.

Fibonacci 2.6.1

(c) 2010 583727 BC Ltd, free for personal use

AMD Athlon(tm) 64 X2 Dual Core Processor 4200+  2209 MHz  4096 MB RAM

Terminal Performance: 12.729 seconds

RAM Performance: 8.049 seconds

Scalar Performance: 14.696 seconds

CPU Large Multiplication Performance: 28.548 seconds

Parallel vector<big_int> Performance: 27.456 seconds

Recursive Factorial Performance: 51.075 seconds

Bubble Sort Performance: 35.365 seconds

Insertion Sort Performance: 4.15 seconds

Shell Sort Performance: 3.65 seconds

Parallel Bitwise Sieve of Eratosthenes Performance: 100.324 seconds

Parallel Goldbach Conjecture Performance: 61.168 seconds

Parallel Collatz Conjecture Performance: 57.86 seconds

Parallel vector<float> normalization: 2.184 seconds

Parallel vector<double> normalization: 2.49 seconds

Parallel matrix<float> multiplication: 31.574 seconds

Parallel matrix<double> multiplication: 32.713 seconds

http://www.contract-developer.tk/products/fibonacci.php