Let T(n) denote time complexity for the input of n elements.
Here, the .count() functions takes O(m) time for m elements.
For every recursive level with k elements, you recur again for \frac{k}{2} elements twice.
Hence, T(n) = 2T(\frac{n}{2}) + O(n)
Solving it gives the final time complexity as \boxed{O(n \log_2n)}