# Insertion Sort Algorithm

Insertion sort is a simple and efficient sorting algorithm that works the way we sort playing cards in our hands. It is based on the idea that one element from the input elements is consumed in each iteration Read More

# Problem on Master Method

In this post I am going to discuss how to use Master Method for solving the recurrence relation. If you are not familiar with the master method see the link Introduction to Master Method. Lets review the three cases Read More

# Master Method for Solving Recurrence

When analyzing algorithm we only care about the asymptotic behavior. Recursive Algorithm are no different. Rather than solving the recurrence relation associated with the cost of an algorithm, it is Read More

# Bubble Sort Algorithm

Bubble sort is the simplest sorting algorithm. It works by iterating the input array from the first element to last. We compare each pairs of elements and swapping them if they are in wrong order. Read More

# Introduction to Algorithms

The word algorithm is come from the name of a Persian author, *Abu Ja’far Mohammed Ibn Musa al Khowarizmi*, who wrote a text book on mathematics. This word Algorithm has a special significance Read More

# Selection Sort Algorithm

Selection Sort is an in-place sorting algorithm. The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning. Read More

# C Program for Tower of Hanoi

The **Tower of Hanoi** (also called the **Tower of Brahma** or **Lucas’ Tower**) is a mathematical game or puzzle. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. Read More

# Finding Time Complexity of a Program

We have discussed RAM Model of Computation and Time Complexity and Asymptotic Notations in previous post. In this post we are going to discuss how to compute the time complexity of different types of programs. Read More