Courses
Tutorials
Practice

Similar Topics

Web Technologies37.5K+ articles

DSA22.8K+ articles

Misc8.8K+ articles

Algorithms2.0K+ articles

Matrix1.3K+ articles

Analysis of Algorithms378+ articles

Arrays257+ articles

Data Structures150+ articles

time complexity26+ articles

Analysis of Algorithms5+ articles

Algorithms-Analysis of Algorithms

29 posts

Analysis of Algorithms

Last Updated: 12 May 2025

Analysis of Algorithms is a fundamental aspect of computer science that involves evaluating performance of algorithms and programs. Efficiency is measured in terms of time...read more

Algorithms-Analysis of Algorithms

What does Big O - O(log N) complexity mean?

Last Updated: 12 February 2024

In the field of computer science and algorithm analysis, Big O notation is a tool used to describe how algorithms perform. It provides a way to estimate how the runtime of...read more

article_image

Algorithms-Analysis of Algorithms

Geeks Premier League

Geeks Premier League 2023

What Does Big O(N^2) Complexity Mean?

Last Updated: 02 April 2024

Prerequisite: Asymptotic Notation and AnalysisAnalysis of Algorithms | Big-O analysisIn this article, we're going to explore into the concept of Big O(N^2) complexity, a c...read more

Algorithms-Analysis of Algorithms

Count number of 1's at specific position in a matrix - II

Last Updated: 02 October 2023

Given a binary matrix mat[][] of size m*n (0-based indexing), the task is to return the total number of 1's in the matrix that follows the below two rules. i.e:Row R and c...read more

Data Structures

Algorithms-Analysis of Algorithms

Count number of 1's at specific position in a Matrix

Last Updated: 24 April 2023

Given a binary matrix mat[][] of size m*n (0-based indexing), find the number of 1's such that 1 is located at a specific position where the same row and same column don't...read more

Algorithms-Analysis of Algorithms

Difference between Big O Notation and Tilde

Last Updated: 16 May 2025

In asymptotic analysis of algorithms we often come across terms like Big O, Omega, Theta and Tilde, which describe the performance of an algorithm.Here, we will see differ...read more

article_image

Algorithms-Analysis of Algorithms

Count array elements whose perfect squares are present in the given array

Last Updated: 13 January 2022

Given an array arr[], the task is to find the count of array elements whose squares are already present in the array.Examples:Input: arr[] = {2, 4, 5, 20, 16}Output: 2Expl...read more

Competitive Programming

Algorithms-Analysis of Algorithms

cpp-unordered_map

Difference between Deterministic and Non-deterministic Algorithms

Last Updated: 24 February 2025

In a deterministic algorithm, for a given particular input, the computer will always produce the same output going through the same states but in the case of the non-deter...read more

article_image

Analysis of Algorithms

Algorithms-Analysis of Algorithms

Cyclomatic Complexity

Last Updated: 05 June 2024

Cyclomatic complexity, developed by Thomas McCabe, is a metric that measures the complexity of a program by counting its decision points. It measures the number of unique ...read more

article_image

time complexity

Analysis of Algorithms

Algorithms-Analysis of Algorithms

Big O Notation Tutorial - A Guide to Big O Analysis

Last Updated: 21 April 2025

Big O notation is a powerful tool used in computer science to describe the time complexity or space complexity of algorithms. Big-O is a way to express the upper bound of ...read more

Analysis of Algorithms

Algorithms-Analysis of Algorithms

Algorithms | Analysis of Algorithms | Question 19

Last Updated: 28 June 2021

Consider the following two functions. What are time complexities of the functions?[tabby title="C"][sourcecode language="c"]int fun1(int n){ if (n <= 1) return n; re...read more

Algorithms-Analysis of Algorithms

Analysis of Algorithms

Algorithms | Analysis of Algorithms | Question 18

Last Updated: 29 July 2021

Consider the following function, int unknown(int n) { int i, j, k = 0; for (i = n/2; i = n; i++) for (j = 2; j = n; j = j * 2) k = k + n/2; ret...read more

Algorithms-Analysis of Algorithms

Analysis of Algorithms

Algorithms | Analysis of Algorithms | Question 17

Last Updated: 28 June 2021

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 two elements with sum less than 1000 in s...read more

Algorithms-Analysis of Algorithms

Analysis of Algorithms

Algorithms | Analysis of Algorithms | Question 16

Last Updated: 28 June 2021

Consider the following three claims:I[Tex](n + k)^m = \theta(n^m)[/Tex]where k and m are constantsII[Tex]2^{n+1} = O(2^n)[/Tex]III 2^{2n+1} = O(2^n)Which of th...read more

Algorithms-Analysis of Algorithms

Analysis of Algorithms

Algorithms | Analysis of Algorithms | Question 15

Last Updated: 28 June 2021

Consider the following functionsf(n) = 3n^{\sqrt{n}}g(n) = 2^{\sqrt{n}{\log_{2}n}}h(n) = n!Which of the following is true? (GATE CS 2000)(A) h(n) is 0(f(n))(B) h(n) is 0(g...read more

Algorithms-Analysis of Algorithms

Analysis of Algorithms