Binary search a list of ints. Recursive implementation in Python.

bin_search.py

def bin_search(L, a):
    if (len(L) == 1):
        return "NO"

    mid = len(L) // 2
    
    if (a < L[mid]):
        return bin_search(L[:mid], a)
    elif (a > L[mid]):
        return bin_search(L[mid:], a)
    else:
        return "YES"

def main():
    a = int(input('Search for: '))
    L = [1,3,5,7,12,18,22,38]
    print(bin_search(L, a))

main()

In C:

#include <string.h>
#include <stdio.h>

int binarysearch(int *nums, int n)
{
  int low, high, mid;

  low = 0;
  high = sizeof(nums);

  while (low <= high)
  {
    mid = (low + high) / 2;
    if (nums[mid] > n)
      high = mid - 1;
    else if (nums[mid] < n)
      low = mid + 1;
    else
      return mid;
  }

  return -1;
}


int main()
{
  int nums[] = {1,2,3,5,34,45,56,7};
  int index0 = binarysearch(nums, 34);
  int index1 = binarysearch(nums, -34);
  printf("%d\n", index0);
  printf("%d\n", index1);
  return 0;
}

Nice work 👍