Unformatted text preview: 4. When you are writing the recurrence, you may ﬁnd it is diﬃcult to ﬁll it some parameters. Recall that you are often able to consider all possible cases on some parameters by brute force. (Example: Question 2a in tutorial 8) 5. Doing the running time analysis is simple. In general, you just need to consider how many time is spent on each entry. Then you count how many entries you have been ﬁlled. Multiplying them together gives you the total running time. (Example: Question 2a in tutorial 8) c ± 2006 Chung Kai Lun Peter. Comments are welcomed. Email: [email protected] 1...
View Full Document
This note was uploaded on 12/09/2010 for the course ENGLISH 1303 taught by Professor May during the Spring '10 term at HKU.
- Spring '10