MCPcopy
hub / github.com/bregman-arie/devops-exercises / main

Function main

coding/python/binary_search.py:30–38  ·  view source on GitHub ↗

Executes the binary search algorithm with a randomly generated list. Time Complexity: O(log n)

()

Source from the content-addressed store, hash-verified

28
29
30def main():
31 """
32 Executes the binary search algorithm with a randomly generated list.
33 Time Complexity: O(log n)
34 """
35 rand_num_li = generate_random_list()
36 target = random.randint(1, 50)
37 index = find_target_in_list(target, rand_num_li)
38 print(f"List: {rand_num_li}\nTarget: {target}\nIndex: {index}")
39
40
41if __name__ == '__main__':

Callers 1

binary_search.pyFile · 0.70

Calls 2

find_target_in_listFunction · 0.85
generate_random_listFunction · 0.70

Tested by

no test coverage detected