Searching_Algorithms.py

def linear_search(arr, target):
    """
    Perform a linear search for the target in the array.

    :param arr: List of elements to search through.
    :param target: The element to search for.
    :return: Index of the target if found, otherwise -1.
    """
    for index, element in enumerate(arr):
        if element == target:
            return index
    return -1


def binary_search(arr, target):
    """
    Perform a binary search for the target in the sorted array.

    :param arr: Sorted list of elements to search through.
    :param target: The element to search for.
    :return: Index of the target if found, otherwise -1.
    """
    left, right = 0, len(arr) - 1

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

    return -1


if __name__ == "__main__":
    # Example usage of searching algorithms
    arr = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
    target = 6

    print("Unsorted array:", arr)
    print("Linear search result:", linear_search(arr, target))
    print("Binary search result:", binary_search(arr, target))