Binary SearchO(log n)
mid = 3 (18 < 42)
4
12
18
42
56
68
Linked ListTraversals
12
→42
→88
BST NodeTree
[ STEP-BY-STEP ALGORITHM VISUALIZER ]
Data Structures and Algos
Visually Animated!
A side project by Jansen, built to make data structures and algorithms easier to understand through clear visuals, hands-on interaction, and step-by-step exploration
Explore
100+ DSA Concepts
in One Place.
Time ComplexitySpace ComplexityArraysLinked ListsStacksQueuesHash TablesBinary TreesBinary Search TreesHeapsTriesGraphsRecursionDynamic ProgrammingGreedy AlgorithmsBacktrackingBinary SearchLinear SearchBubble SortInsertion SortMerge SortQuick SortBreadth-First SearchDepth-First SearchDijkstra’s AlgorithmTime ComplexitySpace ComplexityArraysLinked ListsStacksQueuesHash TablesBinary TreesBinary Search TreesHeapsTriesGraphsRecursionDynamic ProgrammingGreedy AlgorithmsBacktrackingBinary SearchLinear SearchBubble SortInsertion SortMerge SortQuick SortBreadth-First SearchDepth-First SearchDijkstra’s Algorithm
[ CORE MODULES ]
Learn Through Visual Exploration
[ 01 . STRUCTURES ]
Data Structures
A data structure is a specialized format for organizing, processing, retrieving, and storing data in a computer.
[ 02 . ALGORITHMS ]
Algorithms
An algorithm is a step-by-step procedure or formula for solving a problem. It is a set of rules or processes to be followed in calculations.
[ 03 . COMPLEXITY ]
Time Complexity
Big O notation is a mathematical notation used to describe the upper limit of the performance of an algorithm in terms of time or space complexity.
Broken down into the simplest way possible
As an aspiring teacher, making things as easy to understand
as possible for everyone has been my goal.