Question: Pseudocode, input: int Array of length n: No1(A,n) m = 0 for i = 0 to n-1 do for j = i+1 to n-1 do
Pseudocode, input: int Array of length n:
No1(A,n) m = 0 for i = 0 to n-1 do for j = i+1 to n-1 do if No2(A,i,j) AND j-i+1 > m then m = j-i + 1 end if end for end for return m
No2(A,i,j) if i = j then return true end if for t = i to j-1 do if A[t] != A[t+1] then return false end if end for return true
Please explain this pseudocode with an example
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
