Haskell list comprehensions

Is there something deeper to it, or is it just a shitty excuse for not writing, e.g. three for loops in [(a, b, c) | a <- [1..10], b <- [1..10], c <- [1..10], a^2 + b^2 == c^2]
and it still being O(n³)?

>>1
For Loops
Is there something deeper to it, or is it just a shitty way to write e.g. [(a, b, c) | a <- [1..10], b <- [1..10], c <- [1..10], a^2 + b^2 == c^2]?

Also I don't think you know how big O notation works.