Analysis of Algorithms Last Updated : 25 Sep, 2025 Comments Improve Suggest changes Like Article Like Report 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 and space.BasicsWhy is Analysis Important?Order of GrowthAsymptotic Analysis Worst, Average and Best Cases Asymptotic NotationsBig-O Notation Theta - Θ NotationBig – Ω (Big- Omega) NotationTime ComplexitySpace ComplexityBig O vs, Big Omega vs ThetaExamples of Big-O analysis Practice Questions on Time Complexity Analysis Quiz on Time Complexity Analysis Analysis ExamplesAnalyzing LoopsAnalyzing Recursive FunctionsAmortized AnalysisSome Advance topicsP, NP, CoNP, NP hard and NP completeProof that Clique Decision problem is NP-CompleteProof that Independent Set in Graph theory is NP CompleteProve that a problem consisting of Clique and Independent Set is NP CompleteProve that Dense Subgraph is NP Complete by GeneralisationProve that Sparse Graph is NP-Complete Analysis of Algorithms (Background) Visit Course Analysis of Algorithms (Background) Order of Growth Big O Notation Omega Notation Theta Notation | Video Analysis of Common Loops Analysis of Recursion Space Complexity Comment H harendrakumar123 Follow Improve H harendrakumar123 Follow Improve Article Tags : DSA Algorithms-Analysis of Algorithms Explore DSA FundamentalsLogic Building Problems 2 min read Analysis of Algorithms 1 min read Data StructuresArray Data Structure 3 min read String in Data Structure 2 min read Hashing in Data Structure 2 min read Linked List Data Structure 2 min read Stack Data Structure 2 min read Queue Data Structure 2 min read Tree Data Structure 2 min read Graph Data Structure 3 min read Trie Data Structure 15+ min read AlgorithmsSearching Algorithms 2 min read Sorting Algorithms 3 min read Introduction to Recursion 14 min read Greedy Algorithms 3 min read Graph Algorithms 3 min read Dynamic Programming or DP 3 min read Bitwise Algorithms 4 min read AdvancedSegment Tree 2 min read Binary Indexed Tree or Fenwick Tree 15 min read Square Root (Sqrt) Decomposition Algorithm 15+ min read Binary Lifting 15+ min read Geometry 2 min read Interview PreparationInterview Corner 3 min read GfG160 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding Platform 6 min read Problem of The Day - Develop the Habit of Coding 5 min read Like