## 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....
Continue Reading »

## 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...
Continue Reading » ## 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...
Continue Reading »

## c program for quick sort algorithm

Write c program for quick sort algorithm. Quick sort algorithm is very popular algorithm. In average case it is O(NlogN) complexity however only issue with quick sort is the...
Continue Reading »

## 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...
Continue Reading »