โ† Samsung questions

Complexity of a recursive factorial function

Filed under Samsung

Determine the time complexity of a standard recursive factorial function: f(n) = n * f(n-1) with base case f(0)=1.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Samsung questions

Collected from public candidate posts and coding forums. Updated Nov 2026.