CISC 2200: Data Structures
Project 1: Computing Powers

Compare the performance of three different algorithms for computing powers:

• Iterative
• Naive recursive (directly based on the iterative scheme)
• Clever (divide-and-conquer) recursive

We test these methods by computing 2ⁿ for n=0,1,2,..,32 and 2ⁿ for n=0,1,2,..,64.

Based on Chapter 2 of the text (Exercise 18, Programming Problem 1).

Author

Arthur G. Werschulz

Date

1 February 2016