Category Archives: Recursion

Find Nearest 1 Distance in a Binary Matrix

Given a binary matrix of order m*n, the task is to find the distance of nearest 1 for each 0 in the matrix and print final distance matrix. From any cell (i,j), we can move only in four directions up, down, left and right. Note: Distance from one cell to immediate another cell is always incremented by 1.… Read More »

What is Recusion

Recursion is a powerful way of developing algorithms in which the solution of a problem is determined by the solution of one or more identical subproblems. A recursive solution involves two parts: at least one BASE CASE in which the solution returned is not dependent on any solution of any subproblem, and at least one RECURSIVE CASE, where… Read More »