6.1. While: List of squares

"For a given integer N, print all the squares of positive integers where the square is less than or equal to N, in ascending order."

Example input

50

Example output

1 4 9 16 25 36 49

Share your repls and programming experiences

6.1. While: List of squares

"For a given integer N, print all the squares of positive integers where the square is less than or equal to N, in ascending order."

Example input

50

Example output

1 4 9 16 25 36 49

I think it's better to use a while loop here.

For example, if x is one million, the last number of the list will be one million, but you'll compute the square of each number from one to one million (so the last square will be one trillion).

@girianshiido This code publishes only squares which are less than a given number. We have "if i*

2 <= x" here for this. it is equal to your "while ii <= x". just try it // Link to the task: https://repl.it/student/submissions/3764967@pole55 what I meant is that your script is computing too much stuff for its purpose. That's because

range(1, x+1)is way too big, especially ifxitself is big. Ifx=10^10, then you only really need to stop at10^5, because the square of this number is10^10.Here is a modification of your own script:

Try your script with x = 10000000000 and try this new version. You'll see the difference.

@girianshiido, my code gives the same result

its all because of "if i**2 <= x" that tells to stop at "10^5" (in your words). without this part, it will print "10^10".

@pole55 Did you try your code with 10000000000?

Your code doesn't tell to stop at 10^5. It'll try to compute each square from 1 to x², even if i² is already greater than x. Of course, none of these numbers will be in the list, because they don't verify the condition.

@girianshiido the result does not depend on the value of the number. they are still identical. p.s.: I use here a million cause the computer hangs trying to work with 10000000000)). in both, my and yours, cases.

@girianshiido oh. now i see what you are talking about! hmm. thanks

@pole55 I know they’re identical. On my 2011 MBA, it takes forever with your code but it works instantly with the sqrt.

By the way, I just realized I forgot to remove the unnecessary condition

if i^2 <=x.