Finding runtime of recursive algorithms

Question

I\'m trying to find runtime for this algorithm:

Select(A[1 . . . n], k) if n ≤ 100 then
  Return the k-th smallest element via brute-force; else
  Divide A into m