← Home · Knowledge map · ← back to browse

What you need for: Why O(n²) breaks on big inputs

3 prerequisites · learn these first

required (hard)helpful (soft)NumberComputational FluencyPatterns & AlgebraGeometry & MeasurementData & ProbabilityCalculusComputer ScienceFinancial LiteracyLife ScienceChemistryPhysicsEarth & Space ScienceEnvironmental ScienceScience PracticesPhonics & FoundationsReading & ComprehendingVocabulary & Word StudyGrammar & ConventionsWriting & CreatingLiterature & AnalysisOral & Spoken Language

Why O(n²) breaks on big inputsUse of Big-O Notation to Help Predict Run-time Performance

G12

Choosing a sort for the situationClassical Algorithms, Including Sorting and Searching

G12

Sort keys, comparators and stabilityClassical Algorithms, Including Sorting and Searching

G12

Merge sort and divide and conquerClassical Algorithms, Including Sorting and Searching

G12

learn the items on the left, then this · hover a card to trace its chain · click a lessoned card to open it