algorithms
Identify the algorithms, data structures and design patterns used in code (sorting, searching, recursion, hashing, caching/memoization, debounce/throttle, retry with backoff, BFS/DFS, dynamic programming, two pointers, observer, singleton, MVC...) and explain each in plain words with speed (Big-O) in everyday terms. Use when the user asks "what algorithm is this", "how does this work", "is this efficient", "why is it slow", or when you write code built on a notable algorithm. Invoke with a file, function or folder (defaults to the latest code discussed).
Pinned to revision 12b2bf0f3fc7, so it is the text this page describes rather than whatever the author pushed since.
Files
Every link opens the file at its source, pinned to the revision this page describes.