Posts

Showing posts with the label binarysearch

Binary Search, Linear Search, Selection Sort and Bubble sort Python Menu Program

Image
#MENU PROGRAM  #Selection Sort from random import * def SelectionSort():     arr=[]     n=int(input("Enter Size of Array"))     arr=[n]     for i in range(n):         x=randint(0,50)         arr.append(x)     print("List to Sort : ",print(arr))     for i in range(n):         p=i         for j in range(i,n+1):             if arr[p]>arr[j]:                 arr[p],arr[j]=arr[j],arr[p]     print("Your Sorted Array Looks Like ",(arr)) #Bubble Sort def BubbleSort():     arr=[]     n=int(input("Enter Size of Array"))     arr=[n]     for i in range(n):         x=randint(0,50)         arr.append(x)     print("List to Sort : ",print(arr))     for i in range(n):    ...

Binary Search in Python

 arrey=[] strt=0 mid=0 flag=0 j=int(input("Enter how many values ")) last=j for i in range(j):     a=randint(1,100)     arrey.append(a) print(arrey) src=int(input("Enter value to search")) while strt<=last:     mid=int((strt+last)/2)     if arrey[mid]==src:         flag+=1         break     elif src>arrey[mid]:         strt=mid+1     elif src<arrey[mid]:         last=mid-1 if flag==0:     print("Number Not Found ") else:     print("Number Found ")