Question: Page 6 of 8 6. Consider the sorting pseudo code below: while (icn-1) do -1+1 while (jcn) do if A[ijKAl1 then swap(A[1], AL1): end do;
Page 6 of 8 6. Consider the sorting pseudo code below: while (icn-1) do -1+1 while (jcn) do if A[ijKAl1 then swap(A[1], AL1): end do; -i+1 end do; a) Draw the flow graph for this program. (2 points) b) Compute Cyclomatic Complexity for the program.(2 points) c) Write down the basis set (all independent paths) for the program. (4 points)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
