forked from TheAlgorithms/Ruby
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathinterpolation_search.rb
More file actions
39 lines (31 loc) · 1.08 KB
/
interpolation_search.rb
File metadata and controls
39 lines (31 loc) · 1.08 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
# Performs interpolation search on a sorted numeric array.
# Returns the index of the target element or -1 when target is absent.
# Raises ArgumentError if the input array is not sorted in ascending order.
def interpolation_search(array, target)
raise ArgumentError, 'Input must be an array' unless array.is_a?(Array)
return -1 if array.empty?
unless array.each_cons(2).all? { |left, right| left <= right }
raise ArgumentError, 'Array must be sorted in ascending order'
end
left = 0
right = array.length - 1
while left <= right && target >= array[left] && target <= array[right]
return left if array[left] == target
return right if array[right] == target
value_range = array[right] - array[left]
if value_range.zero?
return -1
end
position = left + ((target - array[left]) * (right - left) / value_range)
return -1 if position < left || position > right
current = array[position]
if current == target
return position
elsif current < target
left = position + 1
else
right = position - 1
end
end
-1
end