><Algorithms & data structures
See how sorting, searching, time complexity, and trees shape a solution and its data. — 26 entries
Bubble sort버블 정렬
A sorting algorithm that swaps adjacent values out of order. Each pass places the largest remaining value on the right.
Binary search이진 탐색
Compare the midpoint of a sorted range and discard half at each step.
Merge sort병합 정렬
Split a list into small runs, then merge sorted runs.
Quicksort퀵 정렬
Partition values around a pivot, then sort each side.
Hash table해시 테이블
Hash keys into buckets and keep colliding keys together.
Heap priority queue힙 우선순위 큐
Keep the highest-priority value at the root and bubble new values upward.
Trie prefix tree트라이 접두사 트리
Share prefix nodes and follow one character at a time.
Union-find유니온 파인드
Merge disjoint sets and compare representatives to test membership.
Breadth-first search너비 우선 탐색
Visit nodes by distance from the start using a FIFO queue.
Dijkstra shortest path다익스트라 최단 경로
Settle the cheapest current candidate when edge weights are nonnegative.
Dynamic programming동적 계획법
Store answers to overlapping subproblems to avoid recomputation.
Bloom filter블룸 필터
Test several bits to distinguish definite absence from possible presence.
Filtered approximate nearest-neighbor search필터 결합 근사 최근접 검색
Apply metadata conditions while searching for nearby vectors.
Hierarchical ScaNN tree계층형 ScaNN 트리
Narrow vector candidates through successive cluster levels.
Hybrid retrieval하이브리드 검색
Combine lexical matches with semantic vector candidates.
Reciprocal rank fusion역순위 융합
Convert different result ranks into comparable contributions and sum them.
Neural reranking신경망 재순위화
Rescore first-stage candidates together with the query and reorder them.
TurboQuant터보퀀트
Compress vectors into low-bit representations to reduce search storage.
HNSW vector indexHNSW 벡터 인덱스
Follow layered proximity graphs to find neighbors of a query vector.
Late-interaction retrieval토큰 단위 지연 상호작용 검색
Match each query token to its best document token and sum the scores.
Graph RAG retrieval그래프 기반 RAG 검색
Follow entity relationships from a question to connected evidence.
Personalized PageRank retrieval개인화 페이지랭크 검색
Diffuse probability from query seeds through a graph to rank related nodes.
Depth-first search깊이 우선 탐색
Follow one branch to its end, then backtrack to explore another.
A* searchA* 탐색
Choose the next cell using path cost so far plus estimated remaining cost.
Topological sort위상 정렬
Remove nodes with no incoming edges to produce a dependency order.
Sliding window슬라이딩 윈도
Move a contiguous range while reusing its previous total.