zzos/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-09-28 21:45:27 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix out-of-range recursion in interpolation_search_by_recursion (#15333)

Browse Source
This commit is contained in:
Rızgar Ozan
2026-09-18 02:58:59 +02:00
committed by GitHub
parent 9cf9ad21d2
commit eb06d0d81b
1 changed files with 11 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
searches/interpolation_search.py
+11 -3
View File
@@ -99,16 +99,24 @@ def interpolation_search_by_recursion(
1
>>> interpolation_search_by_recursion([0, 5, 7, 10, 15], 100) is None
True
>>> interpolation_search_by_recursion([0, 5, 7, 10, 15], 16) is None
True
>>> interpolation_search_by_recursion([0, 5, 7, 10, 15], -1) is None
True
>>> interpolation_search_by_recursion([0, 3, 6, 12, 14, 15, 20], 10) is None
True
>>> interpolation_search_by_recursion([], 1) is None
True
>>> interpolation_search_by_recursion([5, 5, 5, 5, 5], 3) is None
True
"""
if right is None:
right = len(sorted_collection) - 1
if left > right:
return None
# avoid divided by 0 during interpolation
if sorted_collection[left] == sorted_collection[right]:
if sorted_collection[left] == item:
return left
return None
return left if sorted_collection[left] == item else None
point = left + ((item - sorted_collection[left]) * (right - left)) // (
sorted_collection[right] - sorted_collection[left]