Question
a)
public static int unisearch(int key)
{
int i = delta[0] - 1;
int j = 0;
while (true)
{
if (key == arr[i])
return i;
else if (delta[j] == 0)
return -1;
else
{
if (key < arr[i])
i += delta[++j];
else
i -= delta[++j];
}
}
}
b)
public static int unisearch(int key)
{
int i = delta[1] - 1;
int j = 0;
while (true)
{
if (key == arr[i])
return i;
else if (delta[j] == 0)
return -1;
else
{
if (key < arr[i])
i -= delta[++j];
else
i += delta[++j];
}
}
}
c)
public static int unisearch(int key)
{
int i = delta[0] - 1;
int j = 0;
while (true)
{
if (key == arr[i])
return i;
else if (delta[j] == 0)
return -1;
else
{
if (key < arr[i])
i -= delta[++j];
else
i += delta[++j];
}
}
}
d) None of the mentioneda.
a
b.
b
c.
c
d.
d
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Choose the appropriate code snippet that performs uniform binary search.
Similar Questions
Discover Related MCQs
Q. What is the time complexity of uniform binary search?
View solution
Q. Given, arr = {1,3,5,6,7,9,14,15,17,19} key = 17 and delta = {5,3,1,0}
How many key comparisons are made?(exclude the comparison used to decide the left or right sub array)
View solution
Q. How can Jump Search be improved?
View solution
Q. Which of the following false about Jump Search?
View solution
Q. Which algorithmic technique does Fibonacci search use?
View solution
Q. Choose the recursive formula for the Fibonacci series.(n>=1)
View solution
Q. What is the time complexity of Fibonacci Search?
View solution
Q. What are the advantages of Fibonacci Search?
View solution
Q. What is the length of the step in jump search?
View solution
Q. What is the time complexity of Jump Search?
View solution
Q. What is an in-place sorting algorithm?
View solution
Q. In the following scenarios, when will you use selection sort?
View solution
Q. What is the worst case complexity of selection sort?
View solution
Q. What is the advantage of selection sort over other sorting techniques?
View solution
Q. What is the average case complexity of selection sort?
View solution
Q. What is the disadvantage of selection sort?
View solution
Q. The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,
View solution
Q. The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,
View solution
Q. What is the best case complexity of selection sort?
View solution
Q. What is an external sorting algorithm?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
