Algorithm

What is Searching Algorithm? A searching algorithm is designed to find an element or object from a collection of elements or objects with a given data structure. For example, search the minimum height from a given a list of heights, or search for the highest mark from a list or array of numbers. Few popular…

Before we learn Binary search, let’s learn: What is Search? Search is a utility that enables its user to find documents, files, media, or any other type of data held inside a database. Search works on the simple principle of matching the criteria with the records and displaying it to the user. In this way,…

What is a Binary Search Tree? The binary search tree is an advanced algorithm used for analyzing the node, its left and right branches, which are modeled in a tree structure and returning the value. The BST is devised on the architecture of a basic binary search algorithm; hence it enables faster lookups, insertions, and…

What is BFS Algorithm (Breadth-First Search)? Breadth-first search (BFS) is an algorithm that is used to graph data or searching tree or traversing structures. The full form of BFS is the Breadth-first search. The algorithm efficiently visits and marks all the key nodes in a graph in an accurate breadthwise fashion. This algorithm selects a…

What is a B+ Tree? A B+ Tree is primarily utilized for implementing dynamic indexing on multiple levels. Compared to B- Tree, the B+ Tree stores the data pointers only at the leaf nodes of the Tree, which makes search more process more accurate and faster. Rules for B+ Tree Here are essential rules for…

What is a B Tree? B Tree is a self-balancing data structure based on a specific set of rules for searching, inserting, and deleting the data in a faster and memory efficient way. In order to achieve this, the following rules are followed to create a B Tree. A B-Tree is a special kind of…

What is Array in Data Structure? An array is a data structure for storing more than one data item that has a similar data type. The items of an array are allocated at adjacent memory locations. These memory locations are called elements of that array. The total number of elements in an array is called…

What is a Circular Linked List? A circular linked list is a sequence of nodes arranged such a way that each node can be retraced to itself. Here a “node” is a self-referential element with pointers to one or two nodes in it’s immediate vicinity. Below is a depiction of a circular linked list with…

What is a Greedy Algorithm? In Greedy Algorithm a set of resources are recursively divided based on the maximum, immediate availability of that resource at any given stage of execution. To solve a problem based on the greedy approach, there are two stages Scanning the list of items Optimization These stages are covered parallelly in…