Algorithm

Key Difference between BFS and DFS BFS finds the shortest path to the destination, whereas DFS goes to the bottom of a subtree, then backtracks. The full form of BFS is Breadth-First Search, while the full form of DFS is Depth-First Search. BFS uses a queue to keep track of the next location to visit….

What is Bucket Sort? Bucket sort, often called bin sort, is a comparison sort method that accepts an unsorted array as an input and produces a sorted array as a result. This method works by distributing the elements into several buckets and sorting each of those buckets individually by any sorting algorithm such as insertion…

What is Shell Sort Shell’s method, or Shell sort in Data structure, is an efficient in-place comparison sort algorithm. It is named after Donald Shell when he proposed the initial idea back in 1959. Shell sort is a generalized extension of the insertion sort algorithm. The fundamental idea of this sorting algorithm is to group…

What is Bisection Method? Bisection Method is one of the basic numerical solutions for finding the root of a polynomial equation. It brackets the interval in which the root of the equation lies and subdivides them into halves in each iteration until it finds the root. Thus, the bisection method is also called the bracketing…

What is a Heap? Heap is a specialized tree data structure. The heap comprises the topmost node called a root (parent). Its second child is the root’s left child, while the third node is the root’s right child. The successive nodes are filled from left to right. The parent-node key compares to that of its…

What is Magic Square? A Magic square is a square matrix with a special number arrangement. These numbers are arranged so that the sum of the numbers on each diagonal, row, and the column remains the same. Magic squares games are simple logic puzzles used in recreational mathematics. Magic squares example: Above given diagram is…

What is Insertion Sort? Insertion sort is one of the comparison sort algorithms used to sort elements by iterating on one element at a time and placing the element in its correct position. Each element is sequentially inserted in an already sorted list. The size of the already sorted list initially is one. The insertion…

What is Pascal’s Triangle? Pascal’s Triangle is a triangular array of numbers followed by a particular pattern and connection to the row before it. It was invented by Blaise Pascal. This triangle starts with one element in the first row. After that, each row starts and ends with “1”. Pascal’s Triangle History The Chinese book…

The Sieve of Eratosthenes is the simplest prime number sieve. It is a Prime number algorithm to search all the prime numbers in a given limit. There are several prime number sieves. For example- the Sieve of Eratosthenes, Sieve of Atkin, Sieve of Sundaram, etc. The word “sieve” means a utensil that filters substances. Thus,…