KnowraAnalysis of algorithmsLinked fromLinked fromThe 10 pages that link to Analysis of algorithms, each with the reason it gives.All 10Broader topic 1Related 3Narrower topic 6Big O notationNarrower topic: Big O is a standard language for expressing algorithm-analysis results.Asymptotic analysisRelated: Asymptotic growth compares algorithm costs while abstracting away machine-specific constants.Amortized analysisNarrower topic: Amortized analysis is one way to characterize algorithmic resource use.Merge sortNarrower topic: Merge sort is a classic example for analyzing recurrences and asymptotic efficiency.Donald KnuthBroader topic: Knuth developed detailed techniques for deriving and presenting algorithm performance.Integer sequenceRelated: Operation counts across input sizes often form integer sequences.Insertion sortNarrower topic: Insertion sort is a classic example for comparing best-, average-, and worst-case costs.Tower of HanoiRelated: Its exact move count makes exponential running time easy to derive and compare.The Art of Computer ProgrammingNarrower topic: The series makes rigorous analysis central to understanding algorithms.Akra–Bazzi methodNarrower topic: The method developed as a specialized tool within this broader discipline.