hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-11-10 11:09:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

create README for exponential search

Browse Source
This commit is contained in:
GohJunLe 2022-08-09 08:48:47 +08:00 committed by GitHub
parent 6197291277
commit c8fca7d2a8
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 16 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
src/algorithms/search/exponential-search/README.md Normal file
View File

@ -0,0 +1,16 @@
# Exponential Search
In computer science, an exponential search is an algorithm.There are numerous ways to implement this with the most common being to determine a range that the search key
resides in and performing a binary search within that range. This takes O(log i) where i is the position of the search key in the list, if the search key is in the list,
or the position where the search key should be, if the search key is not in the list.Exponential search can also be used to search in bounded lists. Exponential search
can even out-perform more traditional searches for bounded lists, such as binary search, when the element being searched for is near the beginning of the array.
![Exponential Search](https://upload.wikimedia.org/wikipedia/commons/4/45/Exponential_search.svg)
## Complexity
**Time Complexity**: `O(log i)` - i is the index of the element being searched for in the list
## References
- [Wikipedia](https://en.wikipedia.org/wiki/Exponential_search)