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(n²)                                                  d. O(n log n)

2. The complexity of Binary search algorithm is

a. O(n)                                                   b. O(log n )                                           c. O(n²)                                                  d. O(n log n)