Unit 10 - Recursion

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

its own local variables, including formal parameters

use of iterative approach

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

progress of recursive process

String, array, and ArrayList objects

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

both iteratively or recursively

Return -1 Value does not lie within list

Recursive sorting algorithm that can be used to sort elements in an array or ArrayList mergeSort(myList) { mergeSort(left) mergeSort(right) mergeSort(left & right) }

Copy original elements to a temporary array and compares the two array to sort a list merge(myArray, low, middle, high)