## Implementation of Binomial Heap | Set – 2 (delete() and decreseKey())

In previous post i.e. Set 1 we have discussed that implements these below functions: insert(H, k): Inserts a key ‘k’ to Binomial Heap ‘H’. This… Read More »

In previous post i.e. Set 1 we have discussed that implements these below functions: insert(H, k): Inserts a key ‘k’ to Binomial Heap ‘H’. This… Read More »

Artificial intelligence is defined as study of rational agents. A rational agent could be anything which makes decisions, like a person, firm, machine, or software.… Read More »

Let us consider the following problem to understand Segment Trees. We have an array arr[0 . . . n-1]. We should be able to 1… Read More »

Consider an array A[] of integers and following two types of queries. update(l, r, x) : Adds x to all values from A[l] to A[r]… Read More »

Dope Vectors is a data structure that is used by compilers to store some metadata about the array like its total size, the size of… Read More »

Tries is a tree that stores strings. Maximum number of children of a node is equal to size of alphabet. Trie supports search, insert and… Read More »

Given an array of size n. Find the maximum sum an increasing subsequence. Examples: Input : arr[] = { 1, 20, 4, 2, 5 }… Read More »

The current article would deal with the concepts surrounding the complex networks using the python library Networkx. It is a Python language software package for… Read More »

Pre-requisite: Suffix Array. What are k-mers? The term k-mer typically refers to all the possible substrings of length k that are contained in a string.… Read More »

Tango Tree is an online algorithm. It is a type of binary search tree. It is better than the offline weight balanced binary search tree… Read More »

Self Organizing list is a list that re-organizes or re-arranges itself for better performance. In a simple list, an item to be searched is looked… Read More »

We have an array arr[]. We need to find the sum of all the elements in the range L and R where 0 <= L… Read More »

Given an array of strings, print them in alphabetical (dictionary) order. If there are duplicates in input array, we need to print all the occurrences.… Read More »

Check whether a given graph contains a cycle or not. Example 1: Input: Output: Graph contains Cycle. Example 2: Input: Output: Graph does not contain… Read More »