64 रिकॉर्ड वाली एक सॉर्टेड लिस्ट (sorted list) पर विचार करें। बाइनरी सर्च (Binary Search) का उपयोग करके किसी विशेष रिकॉर्ड या कुंजी (key) को खोजने के लिए आवश्यक अधिकतम तुलनाओं (comparisons) की संख्या होगी:

Consider the 1-indexed 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 method where mid = floor((low + high) / 2). What is the value of the array element at index 'mid' after two complete iterations?

Consider the following statements regarding algorithmic paradigms: Statement 1: Greedy technique solves all optimization problems correctly and always provides a globally optimal solution. Statement 2: Bellman-Ford, Floyd-Warshall, and Prim's algorithms all use the Dynamic Programming technique to solve path problems. Which of the following is true?