Modules

Binary Search Linear Search Bubble Sort Insertion Sort Linked List Binary Tree Combined Algorithm Stacks Queues Js Canvas Html Modules

Other Features

Night Updates Dev Mode

Combined Algorithm

Python Algorithm

The code is in python for this algorithm

#Coded by Stefan Ralph | Indenting is required
#Search array using linear sort
from random import*
def RandomArrayGenerator():
    Array=[];
    for i in range(100):
       x=randint(1,100)
       Array.append(x)
    return Array
def BinarySearch(search,Array):
     
     
     Max=100
     Min=0
     Found=False
     
     NotPresent=False
     while (Found==False) and (NotPresent==False):
       
         Mid=(Max+Min)//2
         
         if search==Array[Mid]:
             
             Found=True
         elif search> Array[Mid]:
             Min=Mid+1
         elif search<Array[Mid]:
             Max=Mid-1
         else:
             NotPresent=True
     if Found==True:
         print("The position is at ", Mid," using binary search")
     else:
         print("Not Found")

def linearSearch(search,Array):

length=len(Array)
    i=-1
    Found=False
    max=length-1
    while (Found==False) and (i<max):
        i=i+1
        if search==Array[i]:
            Found=True
        
    if Found==True:
        print("The value is at ",i , " using linear search")
        
    else:
        print("Not found")

def BubbleSort(Array):
      
      length=len(Array)
      value=length-1
      NoSwap=False
      while NoSwap==False:
          NoSwap=True
          for i in range(value):
              if Array[i]>Array[i+1]:
                  Temp=Array[i]
                  Array[i]=Array[i+1]
                  Array[i+1]=Temp
                  NoSwap=False
              
                 
                  
          value=value-1
      print("This is the order array - ",Array)
      return Array
    
def InsertionSort(Array):
    
    length=len(Array)
    
    for pointer in range(1,length-1):
       ItemSorting=pointer
       current=pointer-1
       while Array[current]>ItemSorting and current>-1:
          Array[current+1]=Array[current]
          current=current-1
       Array[current+1]=ItemSorting
    print("This is the sorted array using Insertion sort", Array)

ArrayList=RandomArrayGenerator()
print('\n')
print("This is the random created Array",ArrayList)
print('\n')
print('\n')
print('\n')
searchItem=int(input("Enter what you would like to search?"))
print('\n')
print('\n')

linearSearch(searchItem,ArrayList)

print('\n')
print('\n')
print("This is the unordered array - ", ArrayList)

print('\n')
print('\n')

Array=BubbleSort(ArrayList)
print('\n')
print('\n')
#Remember binarysearch will work on ordered arrays
BinarySearch(searchItem,Array)
print('\n')
print('\n')
InsertionSort(ArrayList)

The code is free for anyone to copy and use...The copied code must have the same code and indentation as above

Try it yourself

Download Py