Program 1 #Program for Quick Sort import os def quick_sort(mylist,l,h): # l=0 h=9 low=l # low=0 high=h # high=9 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)...
Program 1 # Implementation of Insertion sort import os mylist=[] os.system(‘cls’) n=int(input(“Enter the limit: “)) for i in range(n): x=int(input()) mylist.append(x) # Insertion sort for k in range(1,n): temp=mylist[k] j=k-1 while(temp<mylist[j] and j>=0): mylist[j+1]=mylist[j]...
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 #Implementation of 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) # Bubble Sort for i in range(0,n): for j in...
Program 1 #Implementation of linear sort import os os.system(‘cls’) mylist=[] n=int(input(“Enter the limit : “)) print(“Enter an 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 # Implementation of 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: “)) low=0 high=n-1...
Program 1 # Implementation of linear search import os os.system(‘cls’) mylist=[] # list 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: “)) flag=False for...
Program 1 # Implementation of circular double linked list import os class Node: def __init__(self): self.ladd=None self.data=None self.radd=None class CircularDoubleList: def __init__(self): self.start=None self.count=0 def create(self): n=int(input(“Enter first element: “)) self.start=Node() self.start.ladd=None self.start.data=n self.start.radd=None...
Program 1 # Implementation of double linked list import os class Node: def __init__(self): self.ladd=None self.data=None self.radd=None class DoubleLinkedList: def __init__(self): self.start=None self.count=0 def create(self): n=int(input(“Enter first element: “)) self.start=Node() self.start.ladd=None self.start.data=n self.start.radd=None temp=self.start...
Program 1 # Queue Linked list import os class Node: def __init__(self): self.data=None self.add=None class QueueLinkedList: def __init__(self): self.start=None def create(self): n=int(input(“Enter First element: “)) self.start=Node() self.start.data=n self.start.add=None self.temp=self.start ch=input(“Wan to continue(Y/y): “) while(ch==’y’...
