Binary search is a better searching algorithm that follows the Divide and Conquer method on the condition that we have sorted/ordered data. Binary Search Algorithm We have three variables that drive the search i.e. start, end, and middle. As their name says start will be at the start=0 of the… Read More »Binary Search in JavaScript
Linear search, also known as sequential search, is an algorithm where we look for an item in a list by comparing each item one by one. It’s a straightforward algorithm that we use every day. Example Given an array arr = [4, 1, 3, 2] and we are looking for… Read More »Linear Search in JavaScript
Fibonacci – Iterative Solution Time Complexity: O(n) time, O(1) space Finds the nth Fibonacci number using iteration. Using a for loop we can get the n number by adding the previous numbers. Generate Fibonacci Series Time Complexity: O(n) time, O(n) space Generates the first n Fibonacci numbers: Fibonacci – Recursive… Read More »Fibonacci – Iterative vs Recursive JS
Sorting algorithms are cool. But, every time I learn or refer to any algorithm in my head or watch a YouTube video, I can understand and recall how it works but, my brain starts yelling – write the code! write the code! If you are trying to learn or understand… Read More »Sorting Algorithms in C++
I had started the #30DaysofCode📚 challenge while I was revising the basic concepts, data structures, and solving easy problems on LeetCode. I documented this so that it helps both me and others to recall what we have learned. How to use this list📑 First, look at the given questions, if… Read More »#30DaysofCode
In programming, Recursion means a function calling itself. The best use of recursion is when we have a big/complex problem and is solved by breaking down the problem into smaller instances. In this post, we’ll see direct and indirect recursion. Types of Recursion Generally, there are two main types of… Read More »Direct & Indirect Recursion