Program 1 import os os.system(‘cls’) a=[] b=[] c=[] m=int(input(“Enter limit of first array”)) print(“Enter element in first array”) for i in range(0,m): x=int(input()) a.append(x) n=int(input(“Enter limit of second array”)) print(“Enter element in second array”)...
Program 1 #Program for Quick Sort import os def quick_sort(mylist,l,h): low=l high=h key=mylist[(low+high)//2] # Pivot element while(low<=high): while(key>mylist[low]): low=low+1 while(key<mylist[high]): high=high-1 if(low<=high): mylist[low],mylist[high]=mylist[high],mylist[low] low=low+1 high=high-1 if(l<=high): quick_sort(mylist,l,high) if(low<h): quick_sort(mylist,low,h) #Main Method os.system(‘cls’) mylist=[] n=int(input(“Enter...
Program 1 #Program for Selection sort import os os.system(‘cls’) mylist=[] n=int(input(“Enter the limit”)) print(“Enter an elements”) for i in range(0,n): x=int(input()) mylist.append(x) for i in range(0,n): min=mylist[i] loc=i for j in range(i+1,n): if(mylist[j]<min): min=mylist[j]...
Program 1 # Program for Insertion sort import os os.system(‘cls’) mylist=[] n=int(input(“Enter the limit”)) print(“Enter elements in collection”) for i in range(0,n): x=int(input()) mylist.append(x) # Login for Insertion sort for k in range(1,n): temp=mylist[k]...
Program 1 #Program for Linear sort import os os.system(‘cls’) mylist=[] n=int(input(“Enter the limit”)) print(“Enter elements”) for i in range(n): x=int(input()) mylist.append(x) # for i in range(0,n): # for j in range(i+1,n): # if(mylist[j]<mylist[i]): #...
Program 1 #Program for Bubble sort import os os.system(‘cls’) mylist=[] n=int(input(“Enter the limit”)) print(“Enter elements”) for i in range(n): x=int(input()) mylist.append(x) for i in range(0,n): for j in range(0,n-i-1): if(mylist[j]>mylist[j+1]): mylist[j],mylist[j+1]=mylist[j+1],mylist[j] print(“Sorted elements: “)...
Program 1 #Program for linear Search import os mylist=[] os.system(‘cls’) n=int(input(“Enter the limit”)) print(“Enter elements”) for i in range(n): x=int(input()) mylist.append(x) s=int(input(“Enter an element for search”)) f=False for i in range(n): if(mylist[i]==s): f=True break...
Program 1 # This is a program for Binary Search import os os.system(‘cls’) mylist=[] n=int(input(“Enter the limit”)) print(“Enter an element”) for i in range(n): x=int(input()) mylist.append(x) mylist.sort() s=int(input(“Enter an element for search”)) f=False low=0...
Program 1 # Program for Addition of digit # s=0 # def addition(n): # global s # if(n>0): # r=n%10 # s=s+r # n=n//10 # addition(n) # return(s) # # Main method code #...
Program 1 # Queue Linked List class Node: def __init__(self): self.add=None self.data=None class QueueList: def __init__(self): self.start=None # This is create Method def createList(self): n=int(input(“Enter an element”)) self.start=Node() self.start.data=n self.start.add=None temp=self.start choice=input(“Want to continue(Y/N)”)...
