Binary Search is nothing but a Searching Algorithm. Which will help you search a element in array. Binary Search is most efficient algorithm for searching a element. The important thing about Binary Search is that, it will only apply to “sorted array”. The array should be sorted or else it will not work. It is faster Algorithm because you can eliminate half of the remaining … Continue reading What is Binary Search?
In simple words, Recursion is a function that calls itself until it meet its basecase. For eg: In above example we call hello function 5 time and decremented every by -1( which n–) until the n become 0. Whenever you use Recursion it is important that you have a basecase. If you don’t have a basecase, the function will run in infinite time and get … Continue reading What is Recursion?
Before explaining what is bubble sort. First we need to understand what is sorting means? Sorting means arranging the data or elements in a particular way. For example You given a array of numbers {1,5,10,8,3,1} which are un-order. You asked to arrange the elements in right order which are {1,1,3,5,8,10}. So, Now you know the concept of sorting. let’s see the basic sorting algorithm called … Continue reading what is bubble sort?
Lets us first understand what is greedy means? Greedy means having an excessive desire . which mean to want more of something. A Greedy algorithm will choice a optimal value at each stage with the hope of finding a global optimum. For example: In the above picture what do you think the maximum output is? If you apply Greedy Algorithm to solve this problem the … Continue reading HOW GREEDY ALGORITHM WORKS ?
PlayBookForCode 