This preview shows pages 1–2. Sign up to view the full content.
Project 1:
Performance Measurement
Given a list of ordered
N
integers, numbered from 0 to
N

1, checking to see that
N
is not in this list provides a worst case for many search algorithms.
Consider two algorithms: one is called “
sequential search
” which scans through
the list from left to right; and the other is “
binary search
” which is given on page 23
of your textbook.
Your tasks are:
(1) Implement an iterative version and a recursive version of sequential search;
(2) Analyze the worst case complexities of the above two versions of sequential
search and that of binary search;
(3) Measure and compare the worst case performances of the above three functions
for
N
= 100, 500, 1000, 2000, 4000, 6000, 8000, 10000.
To measure the performance of a function, we may use C’s standard library
time.h
as the following:
Note:
If a function runs so quickly that it takes less than a tick to finish, we may
repeat the function calls for
K
times to obtain a total run time, and then divide the total
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 02/16/2011 for the course CS 135 taught by Professor Yuechen during the Fall '08 term at Zhejiang University.
 Fall '08
 YueChen
 Algorithms

Click to edit the document details