You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
24 lines
801 B
24 lines
801 B
---
|
|
comments: true
|
|
icon: material/text-search
|
|
---
|
|
|
|
# Chapter 10. Searching
|
|
|
|
{ class="cover-image" }
|
|
|
|
!!! abstract
|
|
|
|
Searching is an unknown adventure, where we may need to traverse every corner of a mysterious space, or perhaps quickly pinpoint our target.
|
|
|
|
In this journey of discovery, each exploration may yield an unexpected answer.
|
|
|
|
## Chapter contents
|
|
|
|
- [10.1 Binary search](binary_search.md)
|
|
- [10.2 Binary search insertion](binary_search_insertion.md)
|
|
- [10.3 Binary search boundaries](binary_search_edge.md)
|
|
- [10.4 Hashing optimization strategies](replace_linear_by_hashing.md)
|
|
- [10.5 Search algorithms revisited](searching_algorithm_revisited.md)
|
|
- [10.6 Summary](summary.md)
|