ProDeveloperTutorial.com - Page 27 of 50 - Tutorials and Programming Solutions

Kadane Algorithm explanation with implementation in C++

Introduction: Kadane Algorithm is an efficient way to solve the maximum sub array problem. Explanation: So before we know about Kadane algorithm, first we shall look at that is the maximum sub array problem? You will be given with an array, you need to find the …

Full Article

No Comments

Sieve Of Eratosthenes

Introduction: Sieve Of Eratosthenes is one of the mose simple and efficient algorithm to find the prime numbers for a given set of limit. Working of the algorithm: The working of algorithm is very simple. Step 1: First we write down all the numbers from 2 …

Full Article

2 Comments

Tower of Hanoi

Introduction Tower of Hanoi is a classic problem that can be solved with the help of recursion. Problem statement: The problem statement is as follows: There are different size of rings placed on top of each other in ascending order. There might be “n” number of …

Full Article

No Comments

Introduction to P, NP, NP hard, NP Complete

In this tutorial we shall learn about what is P, NP, NP hard, NP Complete problems. This is a complex topic. I have tried my best to make you understand in a easy way. First, full form of P and NP. P -> Polynomial Time …

Full Article

No Comments

Knapsack Problem tutorial 2: 0/1 knapsack problem tutorial with implementation

In the previous chapter we have solved fractional knapsack problem. In this chapter we shall solve 0/1 knapsack problem. Problem Statement: You are given ‘n’ number of object with their weights and profits. You are given a bag with max capacity it can hold. Objective …

Full Article

No Comments

Knapsack Problem: Fractional knapsack tutorial with implementation

Knapsack Problem tutorial 1: Fractional knapsack tutorial with implementation

Introduction: There are 2 variants of Knapsack Problem General Knapsack problem / Fractional Knapsack problem: Here the items can be divided. This problem can be solved by greedy method. 0/1 knapsack problem: Where the items cannot be divided. Either you take the whole item or dint …

Full Article

No Comments

String matching algorithms tutorial 3: Introduction to Boyer Moore algorithm and implementation

Introduction: Boyer Moore algorithm is used for pattern searching inside a string. This is the 3rdalgorithm in this pattern search series. This algorithm is very easy to understand. You need to remember below 3 points only. Given a string ‘s’ and pattern ‘p’ we start …

Full Article

No Comments

String matching algorithms tutorial 2: Introduction to Rabin Karp algorithm with implementation.

In this tutorial we shall understand how Rabin Karp algorithm will work. This is the 2ndkind of algorithm we study in pattern matching algorithm set. Rabin karp algorithm uses a hash function and brute force approach to check if a pattern is present inside a string. …

Full Article

No Comments

Introduction to KMP algorithm and implementation

String matching algorithms tutorial 1. Knuth Morris Pratt String matching algorithm and implementation

Problem Statement: You are given a string “s” and a pattern ‘p’. You need to find if the pattern is present in the string “s”. Usually we can solve this by brute force approach. i.e comparing one letter after another, till we find the sub …

Full Article

No Comments

Finding shortest path algorithm tutorial 3: Introduction to Floyd Warshall algorithm and Implementation

In this tutorial we shall learn about Floyd warshall algorithm. This algorithm is used to find shortest path from all the vertices to every other vertex. This is the 3rdtype to find shortest path between source node to destination node. We shall solve this by …

Full Article

No Comments