Skip to main content

Courses About Pricing Educators

Sign in Get started

Courses About Pricing Educators

Get started Sign in

Loading courses

Loading lessons

Algorithms: JavaScript: Uncharted

Courses JavaScriptAlgorithms

Algorithms

Search efficiently, build sorting strategies, traverse graph relationships, and reuse solved subproblems.

JavaScript
Unit 19 of 20
20 lessons
182 min
420 XP

Every lesson is open. Sign in when you are ready to begin.

Sign in to start

Lessons

20 total

1A Recipe with GuaranteesRecognize the finite steps and promised outcome that make a procedure an algorithm.InteractiveConcept6 min20 XPOpen
2Linear Search, Honest WorkImplement linear search and count each inspected element.CodeConcept8 min20 XPOpen
3Halve the HaystackImplement binary search and keep its comparison count logarithmic.CodeConcept10 min20 XPOpen
4Binary Search StepsPredict low, middle, and high bounds across binary-search rounds.InteractiveConcept7 min20 XPOpen
5The Edges of the SearchRepair binary-search bounds for empty, missing, first, and last targets.CodeConcept9 min20 XPOpen
6Bubble Sort: Watch It WorkImplement bubble sort and report the array after every complete pass.CodeConcept10 min20 XPOpen
7Selection SortImplement selection sort and count every remaining-value comparison.CodeConcept9 min20 XPOpen
8Insertion SortImplement insertion sort by growing a sorted left side.CodeConcept9 min20 XPOpen
9Name That SortIdentify a sorting algorithm from the shape of its intermediate passes.InteractiveConcept7 min20 XPOpen
10Merge Two SortedMerge two sorted arrays with one forward pass.CodeConcept8 min20 XPOpen
11Merge SortImplement merge sort by recursively splitting and merging copies.CodeConcept11 min20 XPOpen
12Quicksort, the IdeaImplement a simple recursive quicksort around one pivot.CodeConcept10 min20 XPOpen
13Speed LimitsMatch common search and sort algorithms to their growth classes.InteractiveConcept8 min20 XPOpen
14The Friend MapBuild an undirected graph as an adjacency list and look up one neighborhood.CodeConcept9 min20 XPOpen
15Ripples Outward: BFSUse breadth-first search to find the shortest number of friendship hops.CodeConcept11 min20 XPOpen
16Deep First: DFSExplore a walled maze depth first with sensors until the flag is found.Code worldConcept10 min20 XPOpen
17Visit Order DrillArrange the breadth-first visit order for a fixed graph.InteractiveConcept7 min20 XPOpen
18Stairs and MemoMemoize recursive stair counts so repeated subproblems collapse.CodeConcept10 min20 XPOpen
19Grid PathsCount right-and-down grid routes with recursive memoization.CodePractice11 min20 XPOpen
20Algorithms Mastery CheckCombine sorting, binary search, graph traversal, and memoization in a bounded planner.CodeMastery check12 min40 XPOpen

Data Structures The Hero Road