Design a brute force algorithm to solve this problem and analyze its complexity.
The following algorithm examines all the components in a given array to check for the existence of any two numbers, where one of them is the square of the other, in the given array or not. For example 1: input: A[9,5,28,25,47, 55] output: true For example 2: input: A[24,15,18,18,42, 22] output: false In example 1 […]