MLR
Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad 500 043
Phone Nos: 08418 204066 / 204088, Fax : 08418 204088
UNIT -I
KNOWLEDGE / REMEMBERING
Q. Define Recursion?
Ans:
There are two approaches to write repetitive algorithms: one approach uses loops and the
other one uses recursion
Recursion is a repetitive process, in which a function can call itself.
Recursive functions are useful in evaluating certain types of mathematical functions.
Recursion is also a useful way of creating and accessing dynamic data structures such as linked
lists or binary trees
UNDERSTANDING
Q. Differentiate Recursion and Iteration?
Answer:
ITERATION
RECURSION
Iteration explicitly uses repetition
structure.
Recursion achieves repetition by calling
the same function repeatedly.
Iteration is terminated when the loop
condition fails
Recursion is terminated when base case
is satisfied.
May have infinite loop if the loop
condition never fails
Recursion is infinite if there is no base
case or if base case never reaches.
Iterative functions execute much faster
and occupy less memory space.
Recursive functions are slow and takes a
lot of memory space compared to
iterative functions
APPLYING
Q. Demonstrate the Binary Search Algorithm in Java using recursive
method.
A binary search or half-interval search algorithm finds the position of a specified value (the input
"key") within a sorted array. In each step, the algorithm compares the input key value with the
key value of the middle element of the array. If the keys match, then a matching element has
been found so its index, or position, is returned. Otherwise, if the sought key is less than the
middle element's key, then the algorithm repeats its action on the sub-array to the left of the
middle element or, if the input key is greater, on the sub-array to the right. If the remaining array
to be searched is reduced to zero, then the key cannot be found in the array and a special "Not
found" indication is returned.
Every iteration eliminates half of the remaining possibilities. This makes binary searches very
efficient - even for large collections.
Binary search requires a sorted collection. Also, binary searching can only be applied to a
collection that allows random access (indexing).
Worst case performance: O(log n)
Best case performance: O(1)
Recursion is used in this algorithm because with each pass a new array is created by cutting the
old one in half. The binary search procedure is then called recursively, this time on the new array.
Typically the array's size is adjusted by manipulating a beginning and ending index. The
algorithm exhibits a logarithmic order of growth because it essentially divides the problem
domain in half with each pass.
public class MyRecursiveBinarySearch {
public static int recursiveBinarySearch(int[] sortedArray, int start, int end, int key) {
if (start < end) {
int mid = start + (end - start) / 2;
if (key < sortedArray[mid]) {
return recursiveBinarySearch(sortedArray, start, mid, key);
} else if (key > sortedArray[mid]) {
return recursiveBinarySearch(sortedArray, mid+1, end , key);
} else {
return mid;
}
}
return -(start + 1);
}
public static void main(String[] args) {
int[] arr1 = {2,45,234,567,876,900,976,999};
int index = recursiveBinarySearch(arr1,0,arr1.length,45);
System.out.println("Found 45 at "+index+" index");
index = recursiveBinarySearch(arr1,0,arr1.length,999);
System.out.println("Found 999 at "+index+" index");
index = recursiveBinarySearch(arr1,0,arr1.length,876);
System.out.println("Found 876 at "+index+" index");
}
}
Output:
Found 45 at 1 index
Found 999 at 7 index
Found 876 at 4 index
-
