Python subjective question(Sorting and searching) for competitive exam (15)

Q1.program to sort element using bubblesort.

Solution:
def bubblesort(a):
    for i in range(len(a)):
        for j in range(0,len(a)-i-1):
            if(a[j]>a[j+1]):
                temp=a[j]
                a[j]=a[j+1]
                a[j+1]=temp
data=[3,67,10,98,76]
bubblesort(data)
print("Sorted array using bubble sort")
print(data)
Output
>>> 
==================== RESTART: C:/Users/Dell/Desktop/gg.py ====================
Sorted array using bubble sort
[3, 10, 67, 76, 98]

Q2.Program to search element using linear search.

Solution:
def linearsearch(a,n,x):
    for i in range(0,n):
        if(a[i]==x):
            return i
    return -1
a=[2,5,6,3,8,9]
x=8
n=len(a)
result=linearsearch(a,n,x)
if(result==-1):
    print("element not found")
else:
    print("element found at index",result)            

Q3.Program to sort element using selectionsort.

Solution:
def selectionSort(a,size):
    for step in range(size):
        minidx=step
        for i in range(step + 1,size):
            if a[i] < a[minidx]:
               minidx=i
        (a[step],a[minidx])=(a[minidx],a[step])
data=[2,34,67,4,7,87]
size=len(data)
selectionSort(data, size)
print(data)

Q4.Program to search element using binary search.

Solution:
def binarySearch(a,x,l,h):
    while(l<=h):
        mid=l+(h-l)//2
        if a[mid]==x:
            return mid
        elif a[mid] < x:
            l=mid+1
        else:
             h=mid-1
    return -1
a=[1,2,3,4,5,6,7,8,9]
x=9
result=binarySearch(a,x,0,len(a)-1)
if result!=-1:
    print("element is present at index",str(result))
else:
    print("not found")

Q5.Program to sort element using insertion sort.

Solution:
def insertionsort(a):
    for step in range(1,len(a)):
        key=a[step]
        j=step-1
        while j>=0 and key < a[j]:
             a[j+1]=a[j]
             j=j-1
             a[j+1]=key     
data=[9,3,5,10,34]
insertionsort(data)
print(data)