Pascal's triangle: Difference between revisions

However, this solution is horribly inefficient (O(''n''**2)). It slowly grinds to a halt on a reasonably powerful PC after about line 25 of the triangle.

 

<lang groovy>def count = 15

(1..count).each { n ->