## Heap Sort

Heap sort is a comparison based sorting technique that is based on a Binary Heap data structure. HeapSort is similar …

Heap sort is a comparison based sorting technique that is based on a Binary Heap data structure. HeapSort is similar …

The positive numbers whose only prime factors are 2, 3, or 5 are known as ugly numbers. For eg- 8 …

In Dynamic Programming basics, we will cover the basics of DP and its differences from the Greedy method, Divide and …

Dijkstra is the shortest path algorithm. Dijkstra algorithm is used to find the shortest distance of all nodes from the …

Coin Change Problem – Given some coins of different values c1, c2, … , cs (For instance: 1,4,7….). We need …

Given two matrices, this function will multiply the two matrices and prints the result. Here, necessary and sufficient condition is …

Given two matrices, we will write a function that subtracts the given matrices. Example INPUT A[4][4] = { {1, 4, …

Given two matrices, we will write a function to check whether the two matrices are identical or not. That is, …

Given two matrices, we need to add the two matrices and give new matrix. Example Input : A[4][4] = { …

Given two matrices, we need to add the two matrices and give new matrix. Transpose of a matrix : The …