Question
Consider the following Python code snippet for binary search: def binary_search(arr, target): low = 0 high = len(arr) - 1 while low <= high: mid = (low + high) // 2 if arr[mid] == target: return mid elif arr[mid] < target: low = mid + 1 else: high = mid - 1 return -1 my_list = [10, 20, 30, 40, 50, 60] result = binary_search(my_list, 30) What is the value of mid in the first iteration of the while loop when searching for 30?
More Algorithms Questions
- Which of the following sorting algorithms is a non-comparison-based sort?
- What is the worst-case time complexity of a linear search algorithm on an array of 'N' elements?
- Output of below code public class Prg { public static void main(String args[]){ System.out.print("A" + "B" + 'A'); } }
- Which of the following is an example of inheritance in OOP?
- In the context of inter-process communication (IPC), which of the following mechanisms is used to ensure that only one process accesses a resource at a tim...
- Which algorithm finds Minimum Spanning Tree in a weighted graph by adding edges in increasing order?
- Which graph traversal technique is commonly used for topological sorting?
- Which sorting algorithm divides the array into halves recursively?
- Which of the following algorithms uses a greedy approach?
- Which of the following is true about the Round Robin (RR) CPU scheduling algorithm?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)