I have to build a program which verifies all pairs of numbers from a list if are good for the equation: 3x^2 + 2*y^2 = 5.
User enters a number n and then n numbers (all numbers are ascending and different numbers). I need to show all pairs of numbers (x,y) which verifies the equation above.
I made it with O(nlogn) with two 'for' statements but i know it could be O(n). How can I do this? Thanks!