sln-HW03

sln-HW03 - CSE450/598 Design And Analysis of Algorithms...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CSE450/598 Design And Analysis of Algorithms HW03, Grading Keys Please note that you have to typeset your assignment using either L A T E X or Microsoft Word. Hand-written assignment will not be graded. Also, it is recommended that you save a copy of your assignment on general.asu.edu . 1. (20 pts) This question test your understanding of the ( n log n ) time algorithm for computing the closest pair of points. In the combine step, the algorithm considers the 2 -wide vertical strip at line l , where = min { L , R } and L is the smallest distance in the left part, R is the smallest distance in the right part. If we consider the 4 -wide vertical strip at line l , instead of considering the 2 -wide vertical strip at line l , will it affect the correctness of the algorithm or the asymptotic time complexity of the algorithm? Justify your answer. Solution: The new algorithms will still work correctly. Its time complexity is also ( n log n )....
View Full Document

Page1 / 2

sln-HW03 - CSE450/598 Design And Analysis of Algorithms...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online