1. Algorithm Analysis Exercise
CSCI 3333 Data Structures
Algorithm Analysis Exercise
by Dr. Bun Yue Professor of Computer Science

2. Randomize an array
Write an algorithm to randomize the elements of an array.

3. Estimating Performance Complexity
The program for HW #1 (Summer 2008) is now modified so that the users can submit a file containing many sets of test characters, one set per line. For each set of test characters, your program outputs all words in the dictionary that contain all characters in the set.
Specify the algorithm of your program.
Analyze the algorithm.

4. Big Oh Prove that 10*n1/2 is O(n).
Arrange the following functions in ascending order of Big-Oh of n.

5. Big Oh
Prove that logarithmic time does not depend on the base chosen for the logarithms:
loga n is O(logb n), for any real numbers a > 1 and b > 1.

6. Questions and Comments?