Just little basic about recursion dynamic programming and memorization using some simple example in javascript
working sample https://stackblitz.com/edit/js-h3abpu recursion and memorization these three are the 2 important pillar of computer programming when you are dealing with big task and you want to break your task to smaller parts. let take a example a simple example you have a array and you want to find to maximum value form that array. so let try to solve this problem using recursion //Find a maximum value in a unsorted array //here how i can find max item from a array using recursion function findMax ( arr , len ) { //if length is 1 return first item if ( len == 1 ) { return arr [ 0 ]; } //else recursively search the next maximum item in the array return Math . max ( arr [ len - 1 ], findMax ( arr , len - 1 )) } now find the minimum item in array function findMin ( arr , len = arr . length ) { if ( len == 1 ) { return arr [ 0 ]; } return Math . min ( arr [ len - 1 ], findMin ( arr , ...