mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 23:11:09 +00:00
b6c3fa8992
* fix endless loop bug, divide 0 bug and update description fix an endless bug, for example, if collection = [10,30,40,45,50,66,77,93], item = 67. fix divide 0 bug, when right=left it is not OK to point = left + ((item - sorted_collection[left]) * (right - left)) // (sorted_collection[right] - sorted_collection[left]) update 'sorted' to 'ascending sorted' in description to avoid confusion * delete swap files * delete 'address' and add input validation |
||
---|---|---|
.. | ||
binary_search.py | ||
interpolation_search.py | ||
jump_search.py | ||
linear_search.py | ||
quick_select.py | ||
sentinel_linear_search.py | ||
tabu_search.py | ||
tabu_test_data.txt | ||
ternary_search.py | ||
test_interpolation_search.py | ||
test_tabu_search.py |