Can a recursive algorithm splits a problem into a base case and a recursive case

Yes, a recursive algorithm involves splitting a problem into at least one base, also known as non-recursive or trivial case and at least one recursive case.

The base case is an essential part of the recursive algorithm because it is where the algorithm terminates otherwise the recursive calls will never break, resulting in infinity loop.

The recursive part of the algorithm will ensure that recursive calls actually reaches the base case and problem is solved in the recursive part of the algorithm.

All iterative solution can be written recursively and sometimes its more efficient.