The time complexity of linear search algorithm over an array of n elements is
A.  O (log_{2} n) 
B.  O(n) 
C.  O(n log_{2} n) 
D.  0 (n^{2}) 
Option: B Explanation :
Linear search has lineartime complexity; binary search has logtime complexity.
Here is a table that provides some intuition about the running speeds of algorithms
Logarithmic: Linear:
array size  N

8  8
128  128
256  256
1000  1000
100,000  100,000 ....
Binary search and other divideandconquer algorithms have logN time complexity; we say O(logN)
Linear search have linear time complexity: O(N). So the option is 'B'

The time required to search an element in a linked list of length n is
A.  O(log_{2 }n) 
B.  O(n) 
C.  O(1) 
D.  0 (n^{2}) 
Option: B Explanation : 
The worst case time required to search a given element in a sorted linked list of length n is
A.  O(1) 
B.  O(log_{2} n) 
C.  O(n) 
D.  O(n log_{2} n) 
Option: C Explanation : 
Syllabus covered in this section is
This Section covers Data Structures Questions Answers using C language .
Who can benefit 
Various Search Terms used for this section are