Question 1 Asymptotic Analysis (100 points) This question needs a written answer. Do not forget to...

Transcribed Image Text:

Question 1 Asymptotic Analysis (100 points) This question needs a written answer. Do not forget to put your answer inside your assignment folder with above programming ques- tions before you zip and upload. private static boolean horizontal (char[][] array) { for (int i 0; i < array.length; i++) { = } } for (int j = 0; j < array [0].length - 3; j++) { } boolean c1 = array[i][j + 3] boolean c2 = array[i][j + 2] array[i][j + 1] boolean c3 = if (c1 && c2 && c3) { return true; } return false; == == == array[i][j+ 2] + 1; array[i][j + 1] + 1; array[i][j] + 1; Note: Above method can be written in more compact way. There is an extra lines of code for clarity purposes. Given method may be used to identify horizontal patterns in assignment-1: Question 4 (Go back and take a look if you have forgotten about this). What is the running time of this algorithm (Note that I am not specifying any case-best or worst)? Justify your answer. Note: ● Assume that the array has n rows and m columns. Your answer will contain n and m. • Your goal should be to setup an upper bound using O and a lower bound using . If you can use , that is what we should look for. Question 1 Asymptotic Analysis (100 points) This question needs a written answer. Do not forget to put your answer inside your assignment folder with above programming ques- tions before you zip and upload. private static boolean horizontal (char[][] array) { for (int i 0; i < array.length; i++) { = } } for (int j = 0; j < array [0].length - 3; j++) { } boolean c1 = array[i][j + 3] boolean c2 = array[i][j + 2] array[i][j + 1] boolean c3 = if (c1 && c2 && c3) { return true; } return false; == == == array[i][j+ 2] + 1; array[i][j + 1] + 1; array[i][j] + 1; Note: Above method can be written in more compact way. There is an extra lines of code for clarity purposes. Given method may be used to identify horizontal patterns in assignment-1: Question 4 (Go back and take a look if you have forgotten about this). What is the running time of this algorithm (Note that I am not specifying any case-best or worst)? Justify your answer. Note: ● Assume that the array has n rows and m columns. Your answer will contain n and m. • Your goal should be to setup an upper bound using O and a lower bound using . If you can use , that is what we should look for.