# Introduction to Algorithms ```Introduction to Algorithms
Massachusetts Institute of Technology
Professors Erik D. Demaine and Charles E. Leiserson
September 7, 2005
6.046J/18.410J
Handout 5
Problem Set 1
MIT students: This problem set is due in lecture on Wednesday, September 21, 2005.
The homework lab for this problem set will be held 2–4 P.M. on Sunday, September 18,
2005.
Reading: Chapters 1–4 excluding Section 4.4.
Both exercises and problems should be solved, but only the problems should be turned in.
Exercises are intended to help you master the course material. Even though you should
not turn in the exercise solutions, you are responsible for material covered in the
exercises.
Mark the top of each sheet with your name, the course number, the problem number, your
recitation section, the date and the names of any students with whom you collaborated.
You will often be called upon to “give an algorithm” to solve a certain problem. Your
write-up should take the form of a short essay. A topic paragraph should summarize the
problem you are solving and what your results are. The body of the essay should provide
the following:
1. A description of the algorithm in English and, if helpful, pseudo-code.
works.
3. A proof (or indication) of the correctness of the algorithm.
4. An analysis of the running time of the algorithm.
Remember, your goal is to communicate. Full credit will be given only to correct
solutions which are described clearly. Convoluted and obtuse descriptions will receive
low marks.
Exercise 1-1. Do Exercise 2.3-6 on page 37 in CLRS.
Exercise 1-2. Do Exercise 3.1-6 on page 50 in CLRS.
Exercise 1-3. Do Exercise 3.2-4 on page 57 in CLRS.
Exercise 1-4. Do Problem 4.3-4 on page 75 of CLRS.
Problem 1-1. Asymptotic Notation
For each of the following statements, decide whether it is always true, never true, or
sometimes true for asymptotically nonnegative functions and . If it is always true or
never true, explain why. If it is sometimes true, give one example for which it is true,
and one for which it is false.
�
_
2
Handout 5: Problem Set 1
Problem 1-2. Recurrences
Give asymptotic upper and lower bounds for
Assume that
is constant for
in each of the following recurrences.
Make your bounds as tight as possible,
An array A[1..n] is unimodal if it consists of an increasing sequence followed by a
decreasing sequence, or more precisely, if there is an index
that
such
In particular A[m]is the maximum element, and it is the unique “locally maximum”
element surrounded by smaller elements ( A[m-1] and A[m+1] ).
(a) Give an algorithm to compute the maximum element of a unimodal input array A[1..n]
in O(lgn) time. Prove the correctness of your algorithm, and prove the bound on its
running time.
A polygon is convex if all of its internal angles are less than (and none of the edges cross
eachother). Figure 1 shows an example. We represent a convex polygon as an array
V[1..n] where each element of the array represents a vertex of the polygon in the form of
a coordinate pair (x,y). We are told that V is the vertex with the minimum x coordinate
14l ?3nm
and that the vertices V[1..n] are ordered counterclockwise, as in the figure. You may also
assume that the x coordinates of the vertices are all distinct, as are the y coordinates of
the vertices.
Handout 5: Problem Set 1
3
Figure 1: An example of a convex polygon represented by the array V[1..9]. V is the
vertex with the minimum x -coordinate, and V[1..9] are ordered counterclockwise.
(b) Give an algorithm to find the vertex with the maximum x coordinate in O(lgn) time.
(c) Give an algorithm to find the vertex with the maximum y coordinate in O(lgn) time.
```