671. The complexity of linear search algorithm is
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)

672. The Worst case occur in linear search algorithm when
A. Item is somewhere in the middle of the array
B. Item is not in the array at all
C. Item is the last element in the array
D. Item is the last element in the array or is not there at all

673. The worst case occur in quick sort when
A. Pivot is the median of the array
B. Pivot is the smallest element
C. Pivot is the middle element
D. None of the mentioned

674. What does it mean when we say that an algorithm X is asymptotically more efficient than Y?
A. X will always be a better choice for small inputs
B. X will always be a better choice for large inputs
C. Y will always be a better choice for small inputs
D. X will always be a better choice for all inputs

675. The complexity of Fibonacci series is
A. O(2n)
B. O(log n)
C. O(n2)
D. O(n log n)

676. The complexity of Binary search algorithm is
A. O(n)
B. O(log )
C. O(n2)
D. O(n log n)

677. The complexity of merge sort algorithm is
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)

678. The complexity of Bubble sort algorithm is
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)

679. The worst case complexity for insertion sort is
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)

680. The worst case complexity of quick sort is
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)