10. In binary search, in the part of the code where the Key is compared with Array/mid (e. statement if (key= Array[mid]), if key> Array[mid] then which of the followings will happen: a) The 'Right' range variable is set to 'mid-1. b) The 'Left' range variable is set to 'mid-1. c) The 'Right' range variable is set to 'mid +1. d) The Left' range variable is set to 'mid' +1. 11. The complexity of MergeSort algorithm is a) O(n) b) O(log n) c) O(n) d) O(n log n) 12. The complexity of Binary search algorithm is a) O(n) b) O(log n) (c) O(n) d) O(n log n)
10. In binary search, in the part of the code where the Key is compared with Array/mid (e. statement if (key= Array[mid]), if key> Array[mid] then which of the followings will happen: a) The 'Right' range variable is set to 'mid-1. b) The 'Left' range variable is set to 'mid-1. c) The 'Right' range variable is set to 'mid +1. d) The Left' range variable is set to 'mid' +1. 11. The complexity of MergeSort algorithm is a) O(n) b) O(log n) c) O(n) d) O(n log n) 12. The complexity of Binary search algorithm is a) O(n) b) O(log n) (c) O(n) d) O(n log n)
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 12PE
Related questions
Question
Try to answer maximum questions and simple explanation
![10. In binary search, in the part of the code where the Key is compared with Arraymid)
(.e. statement if (key= Array[mid]), if key> Array(mid] then which of the
followings will happen:
a) The 'Right' range variable is set to 'mid-1.
b) The 'Left' range variable is set to 'mid-1.
c) The 'Right' range variable is set to 'mid +1.
d) The Left' range variable is set to 'mid'+1.
11. The complexity of MergeSort algorithm is
O(n)
b) O(log n)
c) O(n)
d) O(n log n)
12. The complexity of Binary search algorithm is
a) O(n)
b) O(log n)
c) O(n²)
d) O(n log n)
13. Which of the following sorting algorithms in the i-th iteration of the algorithm the
i-th smallest element is moved to position i?
Selection Sort
b) Insertion Sort
c) Merge Sort
d) Bubble Sort](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F548e0d29-afa6-4209-830b-eb254a3be1a0%2Fc69914ed-e54e-4514-8214-d98fcba825a2%2Fhbsnyid_processed.jpeg&w=3840&q=75)
Transcribed Image Text:10. In binary search, in the part of the code where the Key is compared with Arraymid)
(.e. statement if (key= Array[mid]), if key> Array(mid] then which of the
followings will happen:
a) The 'Right' range variable is set to 'mid-1.
b) The 'Left' range variable is set to 'mid-1.
c) The 'Right' range variable is set to 'mid +1.
d) The Left' range variable is set to 'mid'+1.
11. The complexity of MergeSort algorithm is
O(n)
b) O(log n)
c) O(n)
d) O(n log n)
12. The complexity of Binary search algorithm is
a) O(n)
b) O(log n)
c) O(n²)
d) O(n log n)
13. Which of the following sorting algorithms in the i-th iteration of the algorithm the
i-th smallest element is moved to position i?
Selection Sort
b) Insertion Sort
c) Merge Sort
d) Bubble Sort
Transcribed Image Text:7. What is the time complexity of the following code in terms of big O notation?
int i;
cin >>n;
i=1;
while (i<n){
i=1*2;
}
System.out.println(i);
a) O(n)
b) O(nlog n)
o(n²)
d) O(log n)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
