
Apriori Algorithm
In data science and machine learning, discovering patterns in large datasets is essential. One of the most popular algorithms for this task is the Apriori Algor

Insights, tutorials, and ideas...

In data science and machine learning, discovering patterns in large datasets is essential. One of the most popular algorithms for this task is the Apriori Algor

Fractional KnapsackIn the fractional knapsack problem, we have eight items of known values and weights. The capacity of the knapsack is also given. The objectiv

Dynamic Programming & 0/1 KnapsackDynamic programming is used to solve the optimisation problem.Dynamic programming divides the given original problem into


(MST) Kruskal’s & Prim's Algorithm1. ObjectiveKruskal’s Algorithm finds a Minimum Spanning Tree (MST) of a connected, weighted graph by selecting the smalle

Dijkstra’s Algorithm1. DefinitionDijkstra’s Algorithm is a single-source shortest path algorithm used to find the minimum cost path from a source vertex to all


MiniMax Using Divide & ConquerIdeaMiniMax is a decision-making algorithm used in adversarial search (like games).Using divide and conquer, we recursively sp


All Pairs Shortest Path (Floyd-Warshall Algorithm)IntroductionFor a given connected weighted graph , the All Pairs Shortest Path (APSP) problem aims to find the

Binary SearchFloor Functionfloor(x): If x is a real number, then floor(x) is the greatest integer less than or equal to x.Ceil Functionceil(x): If x is a real n


Asymtotic NotationAsymtot is a barier blockage which stop the ...Asymtotic notation are used to categorise the function on the basis of their growth.There are 3


Square Root Decomposition🎯Codeclass SquareRootDecomposition{ vector<int> nums, blocks; int blockSize; public: SquareRootDecomposition(vector
