Show that 8 − 5 + 7 = ( )

Determine whether each of these functions is bounded by O(n). Say yes or no.

() = 3a)
() = + + 12b)
() = ⌊⌋c)
() = 17 + 7d)
() = 15 log e)

() =

2
f)

Exam 1 Review
Friday, January 26, 2024 7:14 AM

Arrange the following functions in ascending order of growth rate.

Solve the following recurrences using Master Theorem.

() = 16

4
+ √

() = 1.5 + 50
() = + log
() = (log )
() = √ log
() = 10
() = +
() = (!)

() =

5
+ 10

In the divide and conquer closest pair of points, we sorted the coordinates
(x or y). Once sorted, are we ready to start computing distances?

Given a positive number , find all combinations of 2 elements such that
every element from 1 to appears exactly twice and the distance
between its two appearances is equal to the value of the element.
Complete the following a backtracking algorithm (findAllComboR) in Java.
Example:
n = 3
Output: 3 1 2 1 3 2

2 3 1 2 1 3

n = 4
Output: 4 1 3 1 2 4 3 2

2 3 4 2 1 3 1 4

public static void findAllCombo(int n)
{

int[] arr = new int[2*n];
Arrays.fill(arr, -1);
findAllComboR(arr, 1, n);

}

public static void findAllComboR(int[] arr, int x, int n)
{

}

Complete the backtracking algorithm in Java (printComboR) to print all possible
combinations of numbers 1 and having the sum . Assume is a positive
integer.

Example: n = 5
[5]
[1,4]
[2,3]

public static void printComboR(int i, int n, int[] A, int index)
{

}

public static void printCombo(int n)
{

int [] A = new int[n];
printComboR(1, n, A, 0);

}