Algo Atlas
한국어

40 entries,
5 categories.

See each step. Understand the idea. A visual guide to algorithms and data structures, with step-by-step demos and code.

Start with sorting

Follow how values move. Open a card for the explanation and implementation code.

···

Bubble sort버블 정렬

Repeatedly compare and swap neighbors so large values drift to the end.

···

Insertion sort삽입 정렬

Insert each new value into the sorted prefix on its left.

···

Merge sort병합 정렬

Split an array in halves, then merge sorted pieces in order.

···

Quicksort퀵 정렬

Partition around a pivot and recursively sort both sides.

Browse by field

Basics

Data structures

Problem families

⇅Sorting

Compare how bubble, insertion, merge, and quick sort move values into place.

View all (7) →
···

Bubble sort버블 정렬

Repeatedly compare and swap neighbors so large values drift to the end.

···

Selection sort선택 정렬

Find the minimum of the remaining range and put it in front.

···

Insertion sort삽입 정렬

Insert each new value into the sorted prefix on its left.

···

Merge sort병합 정렬

Split an array in halves, then merge sorted pieces in order.

O(n)Techniques & complexity

Explore Big O, recursion, binary search, and backtracking one step at a time.

View all (10) →
···

Big O notation빅오 표기법

An asymptotic upper bound on how work grows with input size.

···

Recursion재귀

A function calls itself on smaller instances and returns at a base case.

···

Divide and conquer분할 정복

Split a problem, solve its parts, and combine their results.

···

Binary search이진 탐색

Check the middle of a sorted range and discard half the candidates.

[]Data structures

See how stacks, queues, hash tables, and tries store and find data.

View all (10) →
···

Stack스택

A last-in, first-out structure: the newest item leaves first.

···

Queue큐

A first-in, first-out structure: the oldest item leaves first.

···

Linked list연결 리스트

Each node stores a value and a reference to the next node.

···

Hash table해시 테이블

Map keys through a hash to buckets for lookup and storage.

○─○Graphs

Follow the paths and connections in graphs, BFS, Dijkstra, and minimum spanning trees.

View all (8) →
···

Graph그래프

A structure that represents things as vertices and their relationships as edges.

···

Breadth-first search너비 우선 탐색

Explores a graph one layer at a time, visiting nearby vertices first.

···

Depth-first search깊이 우선 탐색

Follows one route as deep as possible, then backtracks to try another.

···

Dijkstra's algorithm다익스트라 알고리즘

Finds minimum path costs from one source when edge weights are nonnegative.

↗Dynamic programming

Build answers from smaller ones in memoization, knapsack, longest common subsequence, and edit distance.

View all (5) →
···

Dynamic programming동적 계획법

Stores answers to overlapping subproblems so each is solved only once.

···

Memoization메모이제이션

Caches a function result by input and reuses it on repeated calls.

···

0/1 knapsack0/1 배낭 문제

Chooses each item at most once to maximize value within a capacity.

···

Longest common subsequence최장 공통 부분 수열

Finds the longest sequence shared in order, allowing skipped characters.

Open as page ↗