We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent d9a69f4 commit c11aa91Copy full SHA for c11aa91
searches/find_duplicates.py
@@ -42,7 +42,7 @@ def duplicates_bin_search(arr1, arr2):
42
output = []
43
44
for element in arr1:
45
- if binary_search(arr2, element) > 0:
+ if binary_search(arr2, element) >= 0:
46
output.append(element)
47
48
return output
tests/test_find_duplicates.py
@@ -12,8 +12,8 @@ def test_pre_sorted(self):
12
self.assertNotEqual([1,2,3], duplicates_pre_sorted([5,7,1,9,2,10,3],[4,90,23,1,53,3,2,22]))
13
14
def test_bin_search(self):
15
- self.assertEqual([1,2,3], duplicates_linear([1,2,3,4,5,6],[1,2,3,7,8,9]))
16
- self.assertEqual([1,2,3], duplicates_linear([1,2,3,4,5,6],[1,2,3,7,8,9,10,11,12,13,14,15]))
+ self.assertEqual([1,2,3], duplicates_bin_search([1,2,3,4,5,6],[1,2,3,7,8,9]))
+ self.assertEqual([1,2,3], duplicates_bin_search([1,2,3,4,5,6],[1,2,3,7,8,9,10,11,12,13,14,15]))
17
18
def test_bin_search_second_shorter(self):
19
- self.assertEqual([1,2,3], duplicates_linear([1,2,3,7,8,9,10,11,12,13,14,15],[1,2,3,4,5,6]))
+ self.assertEqual([1,2,3], duplicates_bin_search([1,2,3,7,8,9,10,11,12,13,14,15],[1,2,3,4,5,6]))
0 commit comments