## Subset Sum Problem Dynamic Programming

Let us learn Subset Sum Problem Dynamic Programming.The Subset Sum problem takes as input a set X = {x1, x2 ,…, xn} of n integers and another integer K....

## Write a program to find depth of binary search tree without using recursion

If a tree has just one node i.e root node, then the height is 0, if there are 2 levels of nodes then height is 1 and so on....

## Greedy Algorithm: Introduction with example Activity Selection Problem

Greedy algorithm is an algorithm technique which always takes the best immediate, or local, solution while finding an answer.It is a mathematical process that looks for simple, easy-to-implement solutions...

## Pattern searching by KMP algorithm: Implementation in c Program

KMP (Knuth–Morris–Pratt) is a string searching algorithm which runs in O(m + n) time, where m is the length of the pattern and n is the length of the...

## Write a c program for printing all permutation of a string

Write a c program for printing all permutation of a string is a good problem to learn recursive backtracking algorithm.Let us consider a string “abcd“. Then permutation of abc...

## quicksort:implementation in C programming

Quicksort algorithm is very popular algorithm.in average case it is O(NlogN) complexity however only issue with quicksort is the possibility that it degrades to O(n2) on large data sets...

## Quick sort algorithm in glibc library:qsort and its comparator

Quicksort,is a sorting algorithm developed by Tony Hoare. average case makes O(n log n)comparisons to sort n items. In the worst case it makes O(n2) comparisons.Quicksort is often faster...