DOWNLOAD FREE PDF <<CLICK HERE>>
Data Structure Questions and Answers-Binary Search Iterative
Congratulations - you have completed Data Structure Questions and Answers-Binary Search Iterative.
You scored %%SCORE%% out of %%TOTAL%%.
Your performance has been rated as %%RATING%%
Your answers are highlighted below.
Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |
What is the advantage of recursive approach than an iterative approach?
Consumes less memory | |
Less code and easy to implement | |
Consumes more memory | |
All of the mentioned |
Question 1 Explanation:
A recursive approach is easier to understand and contains fewer lines of code.
Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |
Choose the appropriate code that does binary search using recursion.
public static int recursive(int arr[], int low, int high, int key) { int mid = low + (high - low)/2; if(arr[mid | |
public static int recursive(int arr[], int low, int high, int key) { int mid = low + (high + low)/2; if(arr[mid |