Learn Algorithms & Data Structures
Interactive Computer Science — visualized, step by step
Algorithms are easier to understand when you can watch them run. This hub pairs short, plain-language explanations of core computer-science topics with interactive visualizers that animate each step — so an abstract idea like “Dijkstra relaxes the shortest edge first” becomes something you can see and replay.
Every topic below follows the same path: what the idea is, when to reach for it, the time and space cost in Big-O terms, and a tool you can drive yourself. Pick a track and start exploring.
Browse topics
Graph Algorithms
Understand how graphs are traversed and how shortest paths are found. Visualize breadth-first search, depth-first search, Dijkstra and A* pathfinding step by step.
5 tools →Sorting Algorithms
See how sorting algorithms work and why they differ in speed. Visualize bubble, insertion, selection, merge, quick and heap sort with step-by-step animations.
6 tools →Searching Algorithms
Learn how searching algorithms find a value in a collection. Compare linear search and binary search and see why sorting unlocks O(log n) lookups.
2 tools →Data Structures
Explore the core data structures behind every program: stacks, queues, linked lists, binary search trees, heaps and hash tables — visualized and explained.
6 tools →Dynamic Programming
Understand dynamic programming and recursion: how overlapping subproblems and optimal substructure turn exponential brute force into efficient solutions.
4 tools →Number Theory
Explore the number theory that powers algorithms: prime sieves, the Euclidean GCD, prime factorization and famous sequences like the Collatz conjecture.
4 tools →Practice with Games
Turn theory into practice with free educational games: typing speed, mental math drills, flashcards and knowledge quizzes on game.zerethon.com.
6 tools →Zerethon Social で作成・共有・成長しよう
無料登録。ポイントを獲得し、実績を集め、世界中のクリエイターとつながりましょう。