Question

Running time of count ways to divide circle using n non-intersecting chords

Answer 1

Count ways to divide circle using N non-intersecting chords. Given a number N, find the number of ways you can draw N chords in a circle with 2*N points such that no 2 chords intersect. Two ways are different if there exists a chord which is present in one way and not in other.