Absolute Beginner's Guide to Algorithms: A Practical Introduction to Data Structures and Algorithms in JavaScript

Cover PageAbout This eBookTitle PageCopyright PagePearson’s Commitment to Diversity, Equity, and InclusionFigure CreditsContents at a GlanceTable of ContentsAcknowledgmentsDedicationAbout the AuthorTech EditorsPart I: Data Structures1. Introduction to Data StructuresRight Tool for the Right JobBack to Data StructuresConclusionSome Additional Resources2. Big-O Notation and Complexity AnalysisIt’s Example TimeIt’s Big-O Notation Time!ConclusionSome Additional Resources3. ArraysWhat Is an Array?Array Implementation / Use CasesArrays and MemoryPerformance ConsiderationsConclusionSome Additional Resources4. Linked ListsMeet the Linked ListLinked List: Time and Space ComplexityLinked List VariationsImplementationConclusionSome Additional Resources5. StacksMeet the StackA JavaScript ImplementationStacks: Time and Space ComplexityConclusionSome Additional Resources6. QueuesMeet the QueueA JavaScript ImplementationQueues: Time and Space ComplexityConclusionSome Additional Resources7. TreesTrees 101Height and DepthConclusionSome Additional Resources8. Binary TreesMeet the Binary TreeA Simple Binary Tree ImplementationConclusionSome Additional Resources9. Binary Search TreesIt’s Just a Data StructureImplementing a Binary Search TreePerformance and Memory CharacteristicsConclusionSome Additional Resources10. HeapsMeet the HeapHeap ImplementationPerformance CharacteristicsConclusionSome Additional Resources11. Hashtable (aka Hashmap or Dictionary)A Very Efficient RobotFrom Robots to Hashing FunctionsFrom Hashing Functions to HashtablesJavaScript Implementation/UsageDealing with CollisionsPerformance and MemoryConclusionSome Additional Resources12. Trie (aka Prefix Tree)What Is a Trie?Diving Deeper into TriesMany More Examples Abound!Implementation TimePerformanceConclusionSome Additional Resources13. GraphsWhat Is a Graph?Graph ImplementationConclusionSome Additional ResourcesPart II: Algorithms14. Introduction to RecursionOur Giant Cookie ProblemRecursion in ProgrammingConclusionSome Additional Resources15. Fibonacci and Going Beyond RecursionRecursively Solving the Fibonacci SequenceRecursion with MemoizationTaking an Iteration-Based ApproachGoing Deeper on the SpeedConclusionSome Additional Resources16. Towers of HanoiHow Towers of Hanoi Is PlayedThe Single Disk CaseIt’s Two Disk TimeThree DisksThe AlgorithmThe Code SolutionCheck Out the Recursiveness!It’s Math TimeConclusionSome Additional Resources17. Search Algorithms and Linear SearchLinear SearchConclusionSome Additional Resources18. Faster Searching with Binary SearchBinary Search in ActionThe JavaScript ImplementationRuntime PerformanceConclusionSome Additional Resources19. Binary Tree TraversalBreadth-First TraversalDepth-First TraversalImplementing Our Traversal ApproachesPerformance of Our Traversal ApproachesConclusionSome Additional Resources20. Depth-First Search (DFS) and Breadth-First Search (BFS)A Tale of Two Exploration ApproachesIt’s Example TimeWhen to Use DFS? When to Use BFS?A JavaScript ImplementationPerformance DetailsConclusionSome Additional Resources21. QuicksortA Look at How Quicksort WorksAnother Simple LookIt’s Implementation TimePerformance CharacteristicsConclusionSome Additional Resources22. BubblesortHow Bubblesort WorksWalkthroughThe CodeConclusionSome Additional Resources23. Insertion SortHow Insertion Sort WorksOne More ExampleAlgorithm Overview and ImplementationPerformance AnalysisConclusionSome Additional Resources24. Selection SortSelection Sort WalkthroughAlgorithm Deep DiveThe JavaScript ImplementationConclusionSome Additional Resources25. MergesortHow Mergesort WorksMergesort: The Algorithm DetailsLooking at the CodeConclusionSome Additional Resources26. ConclusionHow this Book Came AboutOne more thing! IndexCode Snippets