 # Algorithm

## Genetic Algorithm in Machine Learning

A genetic algorithm is a search algorithm that is inspired by "Darwin's idea of evolution in Nature." It is used in machine learning to tackle optimization problems. It is an important algorithm since it aids in the solution of difficult problems that would otherwise take a long time to solve.

## Hamiltonian Path Algorithm with C++

Overview In this article, we shall learn about Hamiltonian Paths. A Hamiltonian path in a graph is any path that visits every node exactly once, not less, not more. Problem Statement Given, an undirected graph ‘G’, in its adjacency matrix form, contains ‘n’ nodes. Determine whether or not G consists

## Biconnected Graph Algorithm with C++

Overview In this article, we shall learn about biconnected graphs. They’re a kind of graph that is connected and have zero articulation points. Scope In this article we shall learn about: * What is a biconnected graph? * An algorithm to find if a graph is biconnected. * Code implementation and examples.

## Bucket Sort Algorithm with C++

Overview Bucket sort is a sorting algorithm that is used mainly when the input is distributed uniformly over a range. Foran instance, sorting a collection of floating point numbers uniformly distributed within the range [0.0, 1.0]. We may use any of the various sorting algorithms available such as

## Apriori Algorithm

Introduction You will discover all there is to know about the Apriori algorithm in this post. In basket analysis, the Apriori method is regarded as the fundamental algorithm. Basket analysis is the examination of a customer's shopping cart. The objective is to identify frequent itemsets—combinations of products that are

## State Space Reduction in Algorithms

Overview Dynamic programming is a powerful technique for solving optimization problems that can be broken down into smaller subproblems. It involves storing the solutions to these subproblems so that they can be reused, rather than recalculated each time they are needed. This can greatly reduce the time complexity of the

## Disjoint set (Union find Algorithm)

Introduction In this blog, we will discuss the union-find algorithm. But before moving further we need to understand the meaning of a disjoint set. We can call two sets as disjoint if the intersection of two sets is an empty set. In other words, there is no common element between

## Time Complexity of Sorting Algorithms

Introduction Whenever we get a complex array, we simply perform sorting. But have you ever thought about what costs to perform a sorting algorithm? At what time complexity is your sorting algorithm working? Don’t worry. We will cover everything in this article. Time complexity is one of the most

## Job Sequencing Problem with C++

Introduction In this article, we will discuss the job sequencing problem. The job sequencing problem requires us to select jobs in such a way that it maximizes the total profit and deadlines must be taken into consideration. Problem Statement You are given a number of jobs and each job has

## Graph Coloring Problem: Explained

Introduction The graph coloring problem entails assigning colours to specific elements of a graph while adhering to particular limits and constraints. In other terms, Graph coloring refers to the act of assigning colours to vertices so that no two neighbouring vertexes have the same colour. No two nearby vertices, adjacent