Question 1 (10%) You are given a n x n grid. Each grid intersection point can...

Transcribed Image Text:

Question 1 (10%) You are given a n x n grid. Each grid intersection point can be located using row and column indices. Take a look at the color pattern for n = 5. 1 2 3 4 5 1 Red Red Red Red Blue Blue Blue Blue Red Red Red Blue Blue Blue Blue Red Red Red Red Blue Blue Blue Blue W Red Red Red Red Blue Blue Blue 5 Blue Your are provided with the following function to color a triangle specified by ver- tices. paint (color, (i, j), (k, 1), (m, n)) will paint the triangle made out of (i, j), (k, 1) and (m, n) vertices with the color, color. Example: paint (red, (2, 2) (3, 2) (3, 3)) was used to color the above tri- angle in 5 x 5 grid. (a) Write an algorithm, COLORGRID(A), to paint n x n grid according to above color pattern. (5 points) (b) Analyze the running time of the algorithm and justify your answer. (5 points) Note: Do not write Java code. Pseudo code only! Question 1 (10%) You are given a n x n grid. Each grid intersection point can be located using row and column indices. Take a look at the color pattern for n = 5. 1 2 3 4 5 1 Red Red Red Red Blue Blue Blue Blue Red Red Red Blue Blue Blue Blue Red Red Red Red Blue Blue Blue Blue W Red Red Red Red Blue Blue Blue 5 Blue Your are provided with the following function to color a triangle specified by ver- tices. paint (color, (i, j), (k, 1), (m, n)) will paint the triangle made out of (i, j), (k, 1) and (m, n) vertices with the color, color. Example: paint (red, (2, 2) (3, 2) (3, 3)) was used to color the above tri- angle in 5 x 5 grid. (a) Write an algorithm, COLORGRID(A), to paint n x n grid according to above color pattern. (5 points) (b) Analyze the running time of the algorithm and justify your answer. (5 points) Note: Do not write Java code. Pseudo code only!

Answer rating: 100% (QA)

ANSWER SOLUTIONa PSEUDO CODE begin COLORGRIDAn1n1 for i1 to n1 for j1 to ... View the full answer