61 items
Big-Omega Notation
FlashcardLinearithmic Time O(n log n)
FlashcardQuadratic Time O(n^2)
QuizSequential Code Blocks
QuizConstant Time O(1)
QuizLinear Time O(n)
QuizLogarithmic Time O(log n)
QuizLinearithmic Time O(n log n)
QuizExponential Time O(2^n)
QuizOrdering Complexity Classes
QuizCounting Basic Operations
QuizDropping Constants
QuizDropping Lower-Order Terms
QuizComplexity of a Single Loop
QuizComplexity of Nested Loops
QuizInput Size Drives Complexity
QuizHow Runtime Scales
QuizWhat Complexity Analysis Is and Why It Matters
Slides / VideoUsing Complexity to Compare Algorithms
Slides / VideoBest, Average, and Worst Case
Slides / VideoSpace Complexity Basics
Slides / VideoAnalyzing Nested Loops for Time Complexity
Slides / VideoAnalyzing Simple Loops for Time Complexity
Slides / VideoDropping Constants and Lower-Order Terms
Slides / VideoRanking Common Complexity Classes
Slides / VideoSort Then Loop Complexity
Code QuizHalving Loop Logarithmic Time
Code QuizNested Loops Quadratic Time
Code QuizConstant Time Array Access
Code QuizSingle Loop Linear Time
Code QuizLoop With Doubling Step
Code QuizWorst Case Of Linear Search
Code QuizSpace Complexity Of Copy
Code QuizTwo Input Variables
Code QuizSumming Sequential Loops
Code QuizOrdering Growth Rates
Code QuizDropping Constants In Big-O
Code QuizCommon Big-O Complexity Classes
Slides / VideoBig-O as an Upper Bound
Slides / VideoDefinition and Intuition of Big-O Notation
Slides / VideoLogarithmic Time O(log n)
FlashcardQuadratic Time O(n^2)
FlashcardDropping Lower-Order Terms
FlashcardComplexity of Nested Loops
FlashcardAuxiliary Space vs Total Space
FlashcardFactorial Time O(n!)
FlashcardBest, Average, and Worst Case
FlashcardDropping Constants in Big-O
FlashcardComparing Growth Rates
FlashcardSequential Statements (Addition)
FlashcardBig-Theta Notation
FlashcardWhy We Focus on Worst Case
FlashcardBig-O Formal Notation and Meaning
FlashcardLinear Time O(n)
FlashcardCounting Operations
FlashcardConstant Time O(1)
FlashcardComplexity of Single Loops
FlashcardExponential Time O(2^n)
FlashcardHow Runtime Grows as Input Grows
Slides / VideoInput Size n: The Basis of Analysis
Slides / VideoCounting Operations to Estimate Cost
Slides / VideoSort Then Loop Complexity
Fix the incorrect Big-O for a sort followed by a linear scan.
function process(arr) {
// Time complexity: O(n)
arr.sort((a, b) => a - b);
for (let i = 0; i < arr.length; i++) {
console.log(arr[i]);
}
}What is the bug in this code's complexity annotation?