If there are 2 n 1 elements in an array then what would be the-03217
If there are 2(n+1) elements in an array then what would be the number of iterations required to search a number using binary search algorithm?
This multiple choice question (MCQ) is related to the book/course
vu cs201 Introduction to Programming.
It can also be found in
vu cs201 Mid Term - Quiz No.13.
If there are 2(n+1) elements in an array then what would be the number of iterations required to search a number using binary search algorithm?
n elements
(n+1) elements
2(n+1) elements
2(n+1) elements
