I'm analyzing the runtime of an algorithm I wrote. I determined that there are
${{\frac{n(n-1)}{2}} \choose n}$ $\approx$ ${n^2 \choose n}$ = $\frac{n^2!}{n!(n^2-n)!}$ operations in the algorithm.
However I do not know how to simplify this further. I also could be completely off, as I do not have a math major.
Can someone help with this analysis?
You should use Stirling's approximation $k!\approx \frac {k^k}{e^k}\sqrt{2\pi k}$