Prerequisite: Analysis of Algorithms | Big-O analysis In the previous article, the analysis of the algorithm using Big O asymptotic notation is discussed. In this… Read More

# Tag Archives: Analysis of Algorithms

Consider the following two functions. What are time complexities of the functions? int fun1(int n) { if (n <= 1) return n; return 2*fun1(n-1); }… Read More

Consider the following function int unknown(int n) { int i, j, k = 0; for (i = n/2; i

Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are… Read More

Consider the following three claims I (n + k)^m = (n^m), where k and m are constants II 2^(n + 1) = 0(2^n) III 2^(2n… Read More

Consider the following functions Which of the following is true? (GATE CS 2000) (a) h(n) is 0(f(n)) (b) h(n) is 0(g(n)) (c) g(n) is not… Read More

In the following C function, let n >= m. int gcd(n,m) { if (n%m ==0) return m; n = n%m; return gcd(m, n); } How… Read More

Consider the following functions: f(n) = 2^n g(n) = n! h(n) = n^logn Which of the following statements about the asymptotic behavior of f(n), g(n),… Read More

What is the time complexity of Floyd–Warshall algorithm to calculate all pair shortest path in a graph with n vertices? (A) O(n^2logn) (B) Theta(n^2logn) (C)… Read More

What does it mean when we say that an algorithm X is asymptotically more efficient than Y? (A) X will be a better choice for… Read More

The following statement is valid. log(n!) = (n log n). (A) True (B) False Answer: (A) Explanation: Order of growth of and is same for… Read More

In a competition, four different functions are observed. All the functions use a single for loop and within the for loop, same set of statements… Read More

What is the time complexity of the below function? void fun(int n, int arr[]) { int i = 0, j = 0; for(; i <… Read More

Consider the following program fragment for reversing the digits in a given integer to obtain a new integer. Let n = D1D2…Dm int n, rev; … Read More

Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4? f1(n) = 2^n f2(n) = n^(3/2)… Read More