Huffman Coding - Greedy Algorithm - Huffman coding is a lossless data compression algorithm. The idea is to assign variable-legth codes to input characters.

# Category - Algorithm

Kruskal’s Minimum Spanning Tree Algorithm-Greedy Algorithm-Given a connected and undirected graph, a spanning tree of that graph is a subgraph that is a tree...

Activity Selection Problem - Greedy Algorithm - Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that...

Time Complexity of Loop with Powers- Analysis of Algorithm What is the time complexity of below function?Time complexity of above function can be written as

Time Complexity where loop variable is incremented by 1, 2, 3, 4 - Analysis of Algorithm - What is the time complexity of below code?The loop variable ‘i’

Asymptotic Analysis - Algorithm - There are many important things that should be taken care of, like user friendliness, modularity, security,maintainability

Polynomial Time Approximation Scheme (PTAS) is a type of approximate algorithms that provide user to control over accuracy which is a desirable feature.

Time Complexity of building a heap - Analysis of Algorithm - Consider the following algorithm for building a Heap of an input array A.What is the worst case

A Time Complexity Question - Analysis of Algorithm What is the time complexity of following function fun()? Assume that log(x) returns log value in base 2.

NP Completeness- Analysis of Algorithm - In this post,failure stories of computer science are discussed.Can all computational problems be solved by a computer