Decribe a gerneral way to impliment any recursive problem

Am I at the base case? ​ If so, return the easy solution if a function and stop recursing; or if a procedure stop recursing.​ Otherwise, think in terms of solving the current problem by moving closer to the base case with a slightly simpler problem and solving this simpler problem.​