CIS 313 Winter 1997

Introduction to Information Structures

Programming Assignment #2


[ CIS313 | CIS | UO | News ]

Simulate a solution to the Josephus Problem (see Section 13.1) using three different implementations of a linear list: sequential, linked, and balanced binary tree. Instrument your program for execution time measurements and compare performance of the three implementations for different values of arguments m and n.

The first phase of the assignment comprises solution using at least one working implementation; the final deliverable includes all three implementations and complexity experiments.

Notes: