DS LAB #5

#BUBBLE SORTING
"""def bubble_sort(arr):
n=len(arr)
for i in range(n):
for j in range(0,n-1):
if arr[j]>arr[j+1]:
arr[j],arr[j+1]=arr[j+1],arr[j]
arr=[2,1,4,3,6,0]
bubble_sort(arr)

print("print sorted array")

for i in range(len(arr)):
print(arr[i],end=" ")
"""
#SELECTION SORTING
"""import numpy as np

numbers=np.array([2,4,6,78,7,0,5])

print("Unsorted array: ")

print(numbers)

for i in range(len(numbers)-1):
index=i
for j in range(i+1,len(numbers)):
if numbers[j]<numbers[index]:
index=j
if numbers[i]!=numbers[index]:
temp=numbers[i]
numbers[i]=numbers[index]
numbers[index]=temp

print("Selection sort output: ")

print(numbers)"""

#INSERTION SORTING

def insertion_sort(list):

for i in range(1,len(list)):
key=list[i]
j = i-1
 while j >= 0 and key < list[j]:
list[j+1]=list[j]
j-=1
list[j+1]=key

list=[12,2,24,11,23,56,90]
insertion_sort(list)
print("unsorted array")
print(list)
print("Print array")
for i in range(len(list)):
print(list[i],end=" ")

ds lab#6
def linear_search(list,element):
for i in range(len(list)):
if list[i]==element:
return i
return -1
# main method
list=['a','b','c','d','e']
element_for_search='b'
print(linear_search(list,element_for_search))

def binary_search(list,val):
first=0
last=len(list)-1
found=False
while (first<=last and not found):
mid=(first+last)//2
if list[mid]==val:
found=True
else:
if val<list[mid]:
last=mid-1
else:
first=mid+1
return found

print(binary_search([1,2,3,4,5,6],1))