##
Analysis of Algorithms | Set 5 (Practice Problems)
May 2, 2017

We have discussed Asymptotic Analysis, Worst, Average and Best Cases , Asymptotic Notations and Analysis of loops in previous posts.

May 2, 2017

We have discussed Asymptotic Analysis, Worst, Average and Best Cases , Asymptotic Notations and Analysis of loops in previous posts.

April 23, 2017

Prerequisite : Recursion Memory used by a program is sometimes as important as running time, particularly in constrained environments such as mobile devices. For example… Read More »

December 28, 2016

It is a well established fact that merge sort runs faster than insertion sort. Using asymptotic analysis we can prove that merge sort runs in… Read More »

November 22, 2016

For such cases, time complexity of the loop is O(log(log(n))).The following cases analyse different aspects of the problem. Case 1 : In this case, i… Read More »

February 27, 2016

What is Pseudo-polynomial? An algorithm whose worst case time complexity depends on numeric value of input (not number of inputs) is called Pseudo-polynomial algorithm. For… Read More »

September 1, 2015

What is the time complexity of below code?

August 30, 2015

What is the time complexity of below function?

Consider below two C language functions to compute sum of elements in a 2D array. Ignoring the compiler optimizations, which of the two is better… Read More »

February 9, 2015

What is the time complexity of following function fun()?

November 8, 2014

Consider the following C function.

September 23, 2014

Amortized Analysis is used for algorithms where an occasional operation is very slow, but most of the other operations are faster.

March 11, 2014

What is tail recursion? A recursive function is tail recursive when recursive call is the last thing executed by the function.

February 13, 2014

In the previous post, we discussed analysis of loops. Many algorithms are recursive in nature.

February 11, 2014

We have discussed Asymptotic Analysis, Worst, Average and Best Cases and Asymptotic Notations in previous posts.

October 26, 2013

We have discussed Asymptotic Analysis, and Worst, Average and Best Cases of Algorithms. The main idea of asymptotic analysis is to have a measure of… Read More »