CSC 451.1: Topics in Theoretical Computing Science 1

FALL 1998-99

Assignment #2

Instructor: Dr. Pawan Lingras

 Due Date: October 7,1998

Write down a program to find all the classes of anagrams contained in a dictionary. Use the straightforward approach as well as the most efficient approach described in section 3.1.2. Time both the approaches. Submit a well documented programs and outputs. Also write a short note explaining your output and theoretical discussion on time complexity of both approaches.