This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: e. Suggest an improvement or a better algorithm altogether and indicate its efficiency class. 4. Consider a variation of sequential search that scans a list to return the number of occurrences of a given search key in the list. a. Write a pseudo code for this algorithm. b. Will the efficiency of this algorithm compared to the classical sequential search differ? Explain. 5. Indicate whether the first function of each of the following pairs has a smaller, same, or larger order of growth than the second function. 6. Use the formal definitions of O, Θ, and Ω to determine whether the following assertions are true or false. 7. For each of the following functions, indicate the class Θ( f ( n )) the function belongs to. Prove your Answers (using definitions or limits)....
View
Full
Document
This note was uploaded on 05/14/2011 for the course CMPS 323 taught by Professor Shaban during the Spring '11 term at Qatar University.
 Spring '11
 Shaban

Click to edit the document details