#bubble Sort

def bubblsort(list):

for a in range(len(list)-1,0,-1):

for b in range(0,a):

if list[b]>list[b+1]:

list[b],list[b+1]=list[b+1],list[b]

l=list(eval(input('Enter the list elements..:')))

print('Original list:',l)

bubblsort(l)

print()

print('Sorted list:',l)
#Linear Search

def lsearch(lst,x):

flag=False

for i in range(0,len(lst)):

if lst[i]==x:

flag=True

print("The number is found at",i+1,"postion")

if flag==False:

print("The no. was not found")

lst=eval(input("Enter the element:"))

x=int(input("Enter the no. you want to search:"))

lsearch(lst,x)

OUTPUT:
f=open('demofile.txt','wt')

s='now the file has more content','u will be read'

f.writelines(s)

f=open('demofile.txt','rt')

f.seek(0)

fdata=f.read()

print(fdata)

f.close()

Output:
def sum_list(a):

sum=0

for i in range(0,len(a)):

sum=sum+a[i]

return sum

a=eval(input('Enter a list:'))

sum=sum_list(a)

print(sum)

Output:
def binary_search(arr,start,end,x):

arr.sort()

while start<=end:

mid=(start+end)//2

if x<arr[mid]:

end=mid-1

elif x>arr[mid]:

start=mid+1

else:

return mid

return -1

a=eval(input('Enter a list:'))

x=int(input('Enter a element:'))

result=binary_search(a,0,len(a),x)

if result<0:

print('Element is not present!')

else:

print('The element is present at index',result)

OUTPUT:
import random

ran_numb=random.randint(0,30)

print('The generated no. is',ran_numb)

import random

values=[10,20,30,40,50,60,70,80]

begin=random.randint(1,3)

last=random.randint(begin,4)

for i in range(begin,last+1):

print(values[i],end=' ')

OUTPUT:
def fseries(n):

if n==0:

return 0

elif n==2 or n==1:

return 1

return fseries(n-1)+fseries(n-2)

n=int(input('Enter a number:'))

for i in range(n):

print(fseries(i),end=' ')

OUTPUT:
def fseries(n):

a=0

b=1

count=0

while True:

if count==n:

break

sum=a+b

print(a,end=' ')

a,b=b,sum

count+=1

n=int(input('Enter an number:'))

fseries(n)

OUTPUT:
def selection_sort(l):

for i in range(0,n):

min=i

for j in range(i+1,n):

if l[j]<l[min]:

min=j

l[i],l[min]=l[min],l[i]

l=eval(input("Enter a list:"))

n=len(l)

selection_sort(l)

print(l)

OUTPUT: