Quiz Methods-Arrays

T A stack frame contains the values of non-static local variables and parameters

T Recursion is a programming and mathematical tool

T Recursive methods are not always more efficient than equivalent non-recursive methods.

T In a recursive mathematical definition, any recursive reference(s) will NOT always be on a larger value (as eventually it has to reach the base case).

T A stack frame (also known as a stack allocation record) is placed on the run-time stack whenever any method is called

T A (correctly written) recursive Java method typically has at least one basis case

T Tail recursion is when the recursion call is the last operation of a method

T Recursion is used because it is easier for humans to think with it.

T Select Sort is inefficient because it does not exploit already sorted sequences

T SelectionSort can be implemented recursively

T Recursive Fibonacci series is NOT always implemented with two recursion calls in its body (a version with one call was in a class slide)

T Binary Search has a cost bounds given by O(log n), namely some_constant*log(n)