Showing posts with label greedy. Show all posts
Showing posts with label greedy. Show all posts

Sunday, May 24, 2015

Analysis and Design of Algorithm Question Bank



Objective Type Questions:
1. The complexity of linear search algorithm is
a. O(n)                                                   b. O(log n)                                            c. O(n2)                                                  d. O(n log n)

2. The complexity of Binary search algorithm is
a. O(n)                                                   b. O(log n )                                           c. O(n2)                                                  d. O(n log n)

Search Aptipedia