Would a runtime of (n choose (n/2)) be considered polynomial?

Question

Simple question, given an input of size n, would an algorithm with runtime O(n choose (n/2)) = n!/((n/2)!(n/2)!), a.k.a. an algorithm which evaluates every possible partitioning of the input into two sets of equal size, be considered a polynomial time algorithm?