Question

7. hello_world.iml hello # C D Q , eaProjects hello_world - 7. hello_world.iml x Ant //Here is an example problem with answers so you can see what I am looking for. //For writing the recurrence relation, n is the length of the array - start 1/Precondition: start >= 0 public static int exampleProblem(int[] array, int start){ if(start >= array.Length) { return 0; return array[start] + exampleProblem(array, start + 1); Answers: 1. This method finds the sum of the elements in the array from start to the end of the array. 2. f(n) = f(n - 1) + 1, f(0) = 1 3. 0(n)
The first image is example of how I want answers and the second image is questions. Can u please give me answers asap. Thank u.

Answer 1

Q->1:

given code:

1. public void problem1(int index) {
2.     if (index >= 0) {
3.         MyListNode<E> current = first;
4.         for (int i = 0; i < index; i++) {
5.             current = current.getNext();
6.         }
7.         System.out.print(current.getData() + " ");
8.         problem1(index - 1);
9.     }
10. }

Answer:

1. This method prints linked list in reverse from index, means it prints first index elements in reverse order.
2. f(n) = n + f(n-1), first loop i from 0 to index then recursive call for index-1
3. O(n²), because index goes upto 0, and every time it loops from 0 to index in line 4

.

Q->2:

given code:

1. public void problem2(MyListNode<E> node) {
2.     if (node.getNext() != null) {
3.         problem2(node.getNext());
4.     }
5.     System.out.println(node.getData() + " ");
6. }

Answer:

1. This method prints given linked list in reverse order.
2. f(n) = f(n - 1) + 1
3. O(n), because it does a constant time work for printing, and it goes till n.