All Flashcards
What are the general steps for writing a recursive function?
- Identify the base case(s). 2. Define the recursive call to solve a smaller subproblem. 3. Ensure the recursive call moves towards the base case.
What are the steps of the binary search algorithm?
- Find the middle element. 2. Compare the target to the middle element. 3. If target equals middle, return index. 4. If target is less than middle, search the left half. 5. If target is greater than middle, search the right half. 6. Repeat until found or search space is empty.
What are the main steps of the merge sort algorithm?
- Divide the array into two halves. 2. Recursively sort the two halves. 3. Merge the sorted halves.
What are the differences between recursion and iteration?
Recursion: Solves problems by breaking them into smaller, self-similar subproblems. Can be more elegant for some problems. | Iteration: Solves problems by repeating a block of code until a condition is met. Generally more efficient in terms of speed and memory.
What are the differences between linear search and binary search?
Linear Search: Checks each element sequentially. Works on unsorted arrays. | Binary Search: Repeatedly divides the search interval in half. Requires a sorted array.
What are the key differences between iterative and recursive binary search?
Iterative Binary Search: Uses loops to narrow the search space. More efficient in terms of memory usage. | Recursive Binary Search: Calls itself with smaller sub-arrays. Can be more concise and easier to read for some programmers.
What is the core idea behind recursion?
Breaking down a large problem into smaller, self-similar subproblems.
Why is a base case essential in a recursive function?
To prevent infinite loops by providing a terminating condition.
What happens if a recursive function lacks a proper base case?
It results in an infinite loop, potentially causing a stack overflow error.
What is the prerequisite for using binary search on an array?
The array must be pre-sorted.
How does binary search improve search efficiency compared to linear search?
By repeatedly dividing the search space in half, eliminating a large portion of the array from consideration with each step.
What are the two main steps in merge sort?
Divide and Conquer. The divide step splits the array, and the conquer step sorts and merges the halves.
What is the base case for merge sort's recursive calls?
When the array has only one element, it is already sorted.
What is the role of the merge() function in merge sort?
To combine two sorted arrays into a single sorted array.
What are the trade-offs between recursion and iteration?
Recursion can lead to more concise code but may be slower due to function call overhead. Iteration is often faster but can result in more verbose code.
What is the purpose of the index parameter in the recursive array traversal example?
It keeps track of the current position within the array being processed.