Algorithm

What is the largest sum contiguous subarray? A subarray is a continuous part of an array. It can be a single element of an array or some fraction of the array. The largest sum contiguous subarray means a subarray that has the maximum sum value. For example, an array is {-10, 5, 1, 6, -9,…

What is the shortest path or shortest distance? A path from the source vertex to the destination vertex that costs a minimum is the shortest path or shortest distance. In graph theory, it is possible to have multiple routes from a source to a destination. Between these routes, if there is a route that costs…

What is Longest Common Subsequence? Longest Common Subsequence (LCS) means you will be given two strings/patterns/sequences of objects. Among these two sequences/strings, you need to find the longest subsequence of elements in the same order present in both strings or patterns. Example For example, there are two strings provided. Let’s assume that, Pattern_1 = “RGBGARGA”…

What is the Combination? The Combination is a kind of arrangement of some given objects. In mathematical terms, Combination is a set of choices/selection of items from a unique set of items/objects. Here, the order of the items doesn’t matter. It is also known as the method to calculate the total outcome of an event,…

What is a Binary Tree? The word binary means two. In the tree data structure “Binary Tree”, means a tree where each node can have a maximum of two child nodes (left and right nodes). It is a simple binary tree. However, there’s another binary tree that is used most frequently and has several use…

What is Tree Traversal? In the tree data structure, traversal means visiting nodes in some specific manner. There are nodes2 types of traversals. Generally, this kind of traversal is based on the binary tree. A binary tree means each node can have a maximum of 2 nodes. A binary tree is a well-known data structure….

What is Hashing? A hash is a value that has a fixed length, and it is generated using a mathematical formula. Hash values are used in data compression, cryptology, etc. In data indexing, hash values are used because they have fixed length size regardless of the values that were used to generate them. It makes…

What is Heap Sort Algorithm? Heap Sort is one of the popular and faster sorting algorithms. It’s built on the complete binary tree data structure. We will search for the maximum element and put it on the top for the max heap. We will put it on the parent node of the binary tree. Let’s…

What is Selection Sort? SELECTION SORT is a comparison sorting algorithm that is used to sort a random list of items in ascending order. The comparison does not require a lot of extra space. It only requires one extra memory space for the temporal variable. This is known as in-place sorting. The selection sort has…

What is a Bubble Sort? Bubble Sort is a sorting algorithm used to sort list items in ascending order by comparing two adjacent values. If the first value is higher than second value, the first value takes the second value position, while second value takes the first value position. If the first value is lower…