Adobe Interview Report
- 0of 0 votes
Answers1. Consider an ordinary binary min- heap data structure with n elements supporting the instructions INSERT and EXTRACT-MIN in O(lg n) worst case time. Give a potential function f such that the amortized cost of INSERT is O(lg n) and the amortized cost of EXTRACT-MIN is O(1) , and show that it works.
- nikeshjoshi2001 October 27, 2014 in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer Algorithm
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.