C Interview Questions 181-190

This post contains 181-190 questions of c program. It will helpful to solve c aptitude questions, c quiz , c objective type questions etc in interview.

181-190 Questions

Q1:

The time complexity of binary search in average case is
a) O(n) 
b) O(n2) 
c) O(nlogn) 
d) O(logn)
Answer:

Q2:

The time complexity of bubble sort in best case is
a) O(n) 
b) O(n2) 
c) O(nlogn) 
d) O(logn)
Answer:

Q3:

The time complexity of selection sort in best case is
a) O(n) 
b) O(n2) 
c) O(nlogn) 
d) O(logn)
Answer:

Q4:

The time complexity of insertion sort in best case is
a) O(n) 
b) O(n2) 
c) O(nlogn) 
d) O(logn)
Answer:

Q5:

The time complexity of quick sort in best case is
a) O(n) 
b) O(n2) 
c) O(nlogn) 
d) O(logn)
Answer:  

Q6:

The time complexity of heap sort in best case is
a) O(n) 
b) O(n2) 
c) O(nlogn) 
d) O(logn)
Answer:

Q7:

The time complexity of merge sort in best case is
a) O(n) 
b) O(n2) 
c) O(nlogn) 
d) O(logn)
Answer:

Q8:

The best sorting technique among the following is
a) quick 
b) heap 
c) merge 
d) bubble
Answer:

Q9:

In worst case quick sort behaves like
a) insertion 
b) heap 
c) selection 
d) bubble
Answer:

Q10:

The time complexity of bubble sort in worst case is
a) O(n) 
b) O(n2) 
c) O(nlogn) 
d) O(logn)
Answer: