This guide is about algorithms and Big-O,
taking an example-driven approach.
Major Sections
I -- Algorithms
II -- Big O
I -- Algorithms
101 - Introduction to Algorithms
102 - Introduction to Pseudocode
II -- Big O
Chapters
201 - Big-O Notation
202 -- Advanced Big-O
Chapter Indexes
201 - Big-O Notation
Essence of Big-O
Overview
Concepts
Lingo
What is Big-O Notation?
Algorithm Work Effort -- Examples and Quick Quiz
Available Context for Examples
Method 'first' (DynamicArray)
Linear Search
Number of Operations
Big-O Levels and T-Shirts
Notations
Notations Overview
O(1) - Constant
Method 'first' (DynamicArray)
Method 'last' (DynamicArray)
O(n) - linear
O(n
2
) - quadratic
O(log n) - logarithmic
O(n log n) - logarithmic nested in linear
Big-O Practical Tips
Nested or Called Methods
Multiplying Terms
Is O(1) Faster Than O(n)?
Analysis Types
Worst Case Analysis
Average-Case
Amortized Analysis
Upper Bound
Summary
More Information
202 -- Advanced Big-O
Index
Concept
O(1)
O(N
2
)
O(log N)
Big O Wasted Space Analysis
Linked List Versus Array
Comparison
References
Algorithms
Algorithms and Big-O Notation
Quick Index
Top
Search