InfyTQ Algorithms Quiz 1

O(nlogn), O(logn)

O(logn), O(nlogn)

O(n), O(1)

O(1), O(n)

Requires more space

Greater time complexities compared to other searching algorithms

Not easy to understand

Not easy to implement

Both execute at the same speed

Linear search(recursive) is faster

Linear search(Iterative) is faster

Can't be said

To find the lower/upper bound in an ordered sequence

Union of intervals

Debugging

To search in an unordered list

5 and 4

4 and 5

2 and 4

2 and 5

The algorithm that uses tape or disk during the sort

The algorithm that uses main memory during the sort

The algorithm that involves swapping

The algorithm that is considered ‘in place’

13

14

12

11

GCD of two numbers

GCD of more than three numbers

LCM of two numbers

LCM of more than two numbers

 7T(n/2) + Theta(n^2)

8T(n/2) + Theta(n^2)

7T(n/2) + O(n^2)

8T(n/2) + O(n^2)

rand() % (upper – lower)

rand() + lower

(rand()%(upper-lower)) + lower

(rand()%(upper-lower+1)) + lower