First find the bigOh running time of inside in terms of inpu
First, find the big-Oh running time of inside, in terms of input sizes n_a and n_b. private static double[] inside(double[] a, double[] b) {double[] c = new double[a.length]; int i = 0, j = 0; for (int k = 0; k
Solution
The time taken in terms of big O is O(n) as there is only 1 for loop in the function. hence the time complexity is O(n).
Outside the function also The time taken in terms of big O is O(n) as there are 2 for loop but are seprate hence it will take linear time only.
![First, find the big-Oh running time of inside, in terms of input sizes n_a and n_b. private static double[] inside(double[] a, double[] b) {double[] c = new do First, find the big-Oh running time of inside, in terms of input sizes n_a and n_b. private static double[] inside(double[] a, double[] b) {double[] c = new do](/WebImages/38/first-find-the-bigoh-running-time-of-inside-in-terms-of-inpu-1114306-1761591548-0.webp)