Mathematics · Algorithms
Consider the array L = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]. Suppose you are searching for the target value 3 using the standard binary search algorithm (where mid is calculated as floor of (low + high) / 2). What is the value of the array element at the index pointed by the variable 'mid' after the second iteration?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 12
- 23✓
- 311
- 41
Correct answer
3
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Algorithms