# Algorithms — designpattern.fyi

> Fundamental algorithms for searching, sorting, and problem-solving

- **Section**: Algorithms
- **Canonical URL**: https://designpattern.fyi/algorithms/

---

## Patterns in this Category


### [Binary Search](https://designpattern.fyi/algorithms/binary-search/)
- **Summary**: Locate a value in a sorted array in O(log n) by halving the search window on every comparison — never scanning what you can eliminate.
- **Subcategory**: searching


### [Linear Search](https://designpattern.fyi/algorithms/linear-search/)
- **Summary**: Scan every element in sequence until you find the target — no preconditions, no setup, works on anything.
- **Subcategory**: searching


### [Merge Sort](https://designpattern.fyi/algorithms/merge-sort/)
- **Summary**: Sort by recursively splitting in half, sorting each side, and merging back — guaranteed O(n log n) regardless of input, stable.
- **Subcategory**: sorting


### [Quick Sort](https://designpattern.fyi/algorithms/quick-sort/)
- **Summary**: Sort in-place by picking a pivot, partitioning around it, and recursively sorting each side — O(n log n) average with minimal memory.
- **Subcategory**: sorting



---

## Machine-Readable Resources
- **JSON Feed**: https://www.designpattern.fyi/api/patterns.json
- **OpenAPI 3.1**: https://www.designpattern.fyi/api/openapi.json
- **llms.txt**: https://www.designpattern.fyi/llms.txt