PYTHON

the most effective search method in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search methods in python with example

def BinarySearch(lys, val):
    first = 0
    last = len(lys)-1
    index = -1
    while (first <= last) and (index == -1):
        mid = (first+last)//2
        if lys[mid] == val:
            index = mid
        else:
            if val<lys[mid]:
                last = mid -1
            else:
                first = mid +1
    return index
If we use the function to compute:

>>> BinarySearch([10,20,30,40,50], 20)

the most effective search method in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search method in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search methods in python with example

def BinarySearch(lys, val):
    first = 0
    last = len(lys)-1
    index = -1
    while (first <= last) and (index == -1):
        mid = (first+last)//2
        if lys[mid] == val:
            index = mid
        else:
            if val<lys[mid]:
                last = mid -1
            else:
                first = mid +1
    return index
If we use the function to compute:

>>> BinarySearch([10,20,30,40,50], 20)

the most effective search methods in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1
So if we use the function to compute:

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

th most effective search methods in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1
So if we use the function to compute:

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

th most effective search methods in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1
So if we use the function to compute:

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search method in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search method in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search method in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search method in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search methods in python with example

def BinarySearch(lys, val):
    first = 0
    last = len(lys)-1
    index = -1
    while (first <= last) and (index == -1):
        mid = (first+last)//2
        if lys[mid] == val:
            index = mid
        else:
            if val<lys[mid]:
                last = mid -1
            else:
                first = mid +1
    return index
If we use the function to compute:

>>> BinarySearch([10,20,30,40,50], 20)

the most effective search method in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search method in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search method in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search method in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search method in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1
So if we use the function to compute:

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search method in python with example

def LinearSearch(lys, element):
    for i in range (len(lys)):
        if lys[i] == element:
            return i
    return -1

>>> print(LinearSearch([1,2,3,4,5,2,1], 2))

the most effective search methods in python with example

def BinarySearch(lys, val):
    first = 0
    last = len(lys)-1
    index = -1
    while (first <= last) and (index == -1):
        mid = (first+last)//2
        if lys[mid] == val:
            index = mid
        else:
            if val<lys[mid]:
                last = mid -1
            else:
                first = mid +1
    return index
If we use the function to compute:

>>> BinarySearch([10,20,30,40,50], 20)