# How can this function be faster? Solving for a row of Pascal's triangle

I saw a posting on Hacker News this morning that was ranting about people not being able to solve an interview question. I thought I would give it a shot, but I would like to know how my attempt could be improved.

def get_pascal_row(n):
"""
Returns the nth row of Pascal's Triangle for a given n. Uses
Gray's algorithm.
"""
if n == 0: return []
n -= 1
row = [1]
for i in xrange(1,n+1):
row.append(row[-1] * n/i)
n -= 1
return row

-

## migrated from stackoverflow.comJan 24 '13 at 3:11

This question came from our site for professional and enthusiast programmers.

Stop half way through and stick a copy of the first half reversed to the end of your return. – Jaime Jan 24 '13 at 1:45

Start looking in scipy.special.binom.