lec10memo1.py

# lec10memo1.py

# Code shown in Lecture 10, memo 1

# An iterative "Pythonic" search procedure:
def search(list, element):
    for e in list:
        if e == element:
            return True
    return False


# The recursive way:
def rSearch(list,element):
    if element == list[0]:
        return True
    if len(list) == 1:
        return False
    return rSearch(list[1:],element)


# A recursive "Pythonic" binary search procedure:
def rBinarySearch(list,element):
    if len(list) == 1:
        return element == list[0]
    mid = len(list)/2
    if list[mid] > element:
        return rBinarySearch( list[ : mid] , element )
    if list[mid] < element:
        return rBinarySearch( list[mid : ] , element)
    return True