Kode Program tentang SEARCHING

 Nama      : Zania Abuk Da Costa

NIM         : 201552018152957

Tugas       : SEARCHING


1.Terapkan contoh kode program penerapan SEARCHING


# Binary search in phyton

def binary search(array,x,low,high):

# Repeat until the pointers low and high meet each other

while low<=high

     mid =low + (high-low)//2

     if array [mid]==x:

         return mid

     elif array[mid]<x:

           low =mid+1

     else:

          high=mid-1


array =[3,4,5,6,7,8,9]

x=4

result= binary search(array,x,0,len(array)-1)

if result=!=-1:

   print("element is present at index"+ str(result))

else:

     print("Not found")


Komentar

Postingan populer dari blog ini

Algoritma Sorting Quick Sort

greedy