1 MIN READ•
Frequent Pattern Growth (FP-Growth) Algorithm
What is FP-Growth Algorithm?The FP-Growth Algorithm is an advanced data mining technique used to find frequent itemsets without generating candidate sets. It wa
Ashutosh KumarAuthor
Blog
Insights, tutorials, and ideas...
Newest first
All Posts
4 MIN READ•
#Binary Search:
Binary SearchIntuition:Binary search is an efficient algorithm to find a target value within a sorted array. It works on the idea of repeatedly dividing the sea
Abhijeet Singh RajputAuthor
1 MIN READ•
Tower of hanoi
Tower of hanoi1. Problem ExplanationThe Tower of Hanoi is a classic recursive problem.You are given:Three pegs: A (source), B (auxiliary), C (destination)n disk
Divya SachanAuthor
2 MIN READ•
Greedy Approach for Algorithm Design
Greedy Approach for Algorithm DesignThe Greedy Approach is a simple and fast algorithm design technique. At every step, it picks the best possible choice at tha
Abhijeet Singh RajputAuthor
2 MIN READ•
Merge Sort
Merge SortMerge Sort is a Divide and Conquer algorithm.Given an array a[1…N], merge sort works as follows:Divide the array into two equal halves.Recursively app
Ashutosh KumarAuthor
3 MIN READ•
Quick Sort
Quick SortIt is a popular sorting method based on the divide-and-conquer approach. Unlike merge sort, where the division is always in the middle, in quicksort t
Abhijeet Singh RajputAuthor
1 MIN READ•
Random Forest (ID3 algorithm)
Random Forest (ID3 algorithm)Random Forest is a machine-learning algorithm that builds many decision trees and then combines their results to make a better fina
Divya SachanAuthor
1 MIN READ•
Compare the growth of the functions
DAA Assignment 1Compare the growth of the functions and lett(n) = g(n) = This is an form, so apply L'Hopital's RuleApply L hopital Ruledifferentiate the numer
Divya SachanAuthor
1 MIN READ•
comparison of two functions
Compare the growth of two functions0 implies has smaller order of growth than c implies has same order of growth as implies has larger order of growth than
Abhishek SinghAuthor
4 MIN READ•
HWI Practice
HWI Practice1. Subarrays with Even Sum Starting with Odd NumberProblem: Find the number of subarrays with an even sum that start with an odd number.Approach: Pr
Abhijeet Singh RajputAuthor
2 MIN READ•
Manacher's Algorithm
Manacher's Algorithm (hard)Manacher’s Algorithm finds the longest palindromic substring in linear time by reusing previously computed palindrome information. In
Ashutosh KumarAuthor
2 MIN READ•
Decision Tree Algorithm
Decision Tree Algorithm✅ Steps to Construct a Decision TreePlace the best feature (attribute) of the dataset at the root of the tree.Split the training set into
Divya SachanAuthor
2 MIN READ•
Apriori Algorithm
Apriori Algorithm in Machine LearningThe Apriori Algorithm is used for association rule learning on transactional databases. It identifies frequent itemsets and
Divya SachanAuthor
2 MIN READ•
ID3 Algorithm
AlgorithmConstruct the decision tree using the algorithm for the given data set.S.noAgeCompetitionTypeProfit (Class)1OldYesSoftDown2OldNoSoftDown3OldNoHardDown
Divya SachanAuthor