-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrecursive_binary_search_2.rb
More file actions
63 lines (47 loc) · 1.3 KB
/
recursive_binary_search_2.rb
File metadata and controls
63 lines (47 loc) · 1.3 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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
def recursive_binary_search(list, target)
p list
l = list.length
if l == 0 # Base case or stopping condition
return false
elsif l == 1 # Base case 2 or stopping condition 2
if list[0] == target
return true
else
return false
end
else
mid_point = (l/2).floor
if list[mid_point] == target
return true
else
if list[(mid_point-1)] < target
p list[mid_point..-1]
return recursive_binary_search(list[mid_point..-1], target)
else
p list[0..mid_point-1]
return recursive_binary_search(list[0..(mid_point-1)], target)
end
end
end
end
def verify(result)
puts "Target found? : #{result}"
end
list = [1,2,3,4,5,6,7,8,9,10,11]
# Tests
result = recursive_binary_search(list, 0)
verify(result)
result = recursive_binary_search(list, 1)
verify(result)
result = recursive_binary_search(list, 2)
verify(result)
result = recursive_binary_search(list, 10)
verify(result)
result = recursive_binary_search(list, 11)
verify(result)
result = recursive_binary_search(list, 12)
verify(result)
result = recursive_binary_search(list, -1)
verify(result)
result = recursive_binary_search(list, 1.2)
verify(result)