Add documented binary search script scaffold with runnable examples

[Copilot]

This PR adds a simple Python script structure for binary search with clear comments, matching the requested algorithm-notes style. It introduces a reusable function plus minimal runnable examples for both found and not-found outcomes.

• Binary search script

  • Added binary_search.py with a compact iterative binary_search(sorted_numbers, target) implementation.
  • Included inline comments that explain pointer initialization, midpoint selection, range narrowing, and -1 fallback.

• Executable usage examples

  • Added __main__ examples that demonstrate:
    • target present in the sorted list
    • target absent from the sorted list

• Repository hygiene for Python artifacts

  • Added .gitignore entries for Python cache/bytecode files (__pycache__/, *.pyc).
  • Removed tracked bytecode cache artifact from version control.

def binary_search(sorted_numbers, target):
    left = 0
    right = len(sorted_numbers) - 1

    while left <= right:
        mid = left + (right - left) // 2
        if sorted_numbers[mid] == target:
            return mid
        if sorted_numbers[mid] < target:
            left = mid + 1
        else:
            right = mid - 1

    return -1

Original prompt

Create a simple Python script structure for a binary search algorithm with comments.