def fibonacci(n): if n <= 1: return n return fib(n-1) + fib(n-2)

for i in range(n): for j in range(n): if arr[j] > arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j]

def binary_search(arr, x): l, r = 0, len(arr)-1 while l <= r: mid=(l + r) // 2 if arr[mid]==x: return mid