Unit 10 - Recursion

Question 1

Recursive method

Answer 1

One that calls itself

Contains at least one base case which halts the recursion and at least one recursive call -> conditional

Question 2

Each recursive call contains

Answer 2

its own local variables, including formal parameters

Question 3

Any recursive solution can be replicated through

Answer 3

use of iterative approach

Question 4

Infinite recursion

Answer 4

Value is not changing in a way that allow base case to be reached -> CallStackOverFlowException

Question 5

Parameter values capture

Answer 5

progress of recursive process

Question 6

Recursion can be used to traverse

Answer 6

String, array, and ArrayList objects

Question 7

Binary search algorithm

Answer 7

Data must be sorted
Starts in middle of sorted array or ArrayList and eliminates half of the array or ArrayList in each iteration until desired value is found or all elements has been eliminated

Question 8

Binary search algorithm can be written

Answer 8

both iteratively or recursively

Question 9

What do we o when lowPosition > highPosition?

Answer 9

Return -1

Value does not lie within list

Question 10

Merge sort

Answer 10

Recursive sorting algorithm that can be used to sort elements in an array or ArrayList

mergeSort(myList)
{
      mergeSort(left)
      mergeSort(right)
      mergeSort(left & right)
}

Question 11

Merge Method

Answer 11

Copy original elements to a temporary array and compares the two array to sort a list

merge(myArray, low, middle, high)