This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 473: Algorithms, Fall 2010 HW 0 (due Tuesday, August 31st in class) This homework contains four problems. Read the instructions for submitting homework on the course webpage . In particular, make sure that you write the solutions for the problems on separate sheets of paper. Write your name and netid on each sheet. Collaboration Policy: For this home work, each student should work independently and write up their own solutions and submit them. Read the course policies before starting the homework. Problems 1-3 should be answered in Compass as part of the assessment HW0-Online. Note: Before starting to answer the questions on compass, read the following recaps: • lg n = log 2 n and ln n = log e n . • lg 2 n = (lg n ) 2 and lg lg n = lg(lg n ). • H n is the n ’th harmonic number and H n = ∑ n i =1 1 /i ’ ln n + 0 . 577215 ... . • F n is the n ’th Fibonacci number and satisfies the recurrence F n = F n- 1 + F n- 2 with F = ,F 1 = 1. It can be verified by induction (try it!) that= 1....
View Full Document
- Fall '08
- Algorithms, Analysis of algorithms, LG, Greatest common divisor, Euclidean algorithm, Fibonacci number