CMSC 341 -- Spring 2005 -- Project 5 Questions

Copy this file into your directory and edit it to add your answers
to the following questions about Project 5.

This questions count for 10% of your project grade.

In this project, both WithdrawJob and IncreasePrice involve 
finding a job in the heap with a given ID. 

1) What is the time complexity (i.e., worst case time
   performance) of this find-by-ID operation?

2) If the size and unit price of the job is also available
   (its priority becomes known), can you utilize this 
   information to make find operation more efficient? 
   If your answer is yes, briefly describe how it works and 
   give the time complexity of your new method; otherwise,  
   explain why no improvement can be made with this information.

Time complexity should be given in big-Oh notation.