Kompyuter tizimlari kafedrasi

1. Iterative Method
Dastur kodi:
# Binary Search python da

def binarySearch(massiv, x, low, high):

# Repeat until the pointers low and high meet each other
while low <= high:

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

if massiv[mid] == x:
return mid

elif massiv[mid] < x:

low = mid + 1

else:
high = mid - 1

return -1

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

x = 4

result = binarySearch(massiv, x, 0, len(massiv)-1)

if result != -1:
print("Element mana shu indexda turibdi " + str(result))
else:
print("Topilmadi")
Dastur natijasi:

2.Iterativ metod bilan binary qidiruvdan foydalanish
2.Rekursiv Metod
Dastur kodi:
# Binary Search python da
def binarySearch(massiv, x, low, high):
if high >= low:
mid = low + (high - low)//2
if massiv[mid] == x:
return mid
elif massiv[mid] > x:
return binarySearch(massiv, x, low, mid-1)
else:
return binarySearch(massiv, x, mid + 1, high)
else:
return -1
massiv = [3, 4, 5, 6, 7, 8, 9]
x = 4
result = binarySearch(massiv, x, 0, len(massiv)-1)
if result != -1:
print("Element shu indexda turibdi: " + str(result))
else:
print("Topilmadi")
Dastur natijasi

3.Rekursiv Metod binary qidiruv algritmi
Bubble Sort
Pufakchali saralash ikki qo‘shni elementni solishtiradigan va ularni mo‘ljallangan tartibda bo‘lmaguncha almashtiradigan tartiblash algoritmidir.

Xuddi suv yuzasiga ko'tarilgan havo pufakchalarining harakati kabi, massivning har bir elementi har bir iteratsiyada oxirigacha harakat qiladi. Shuning uchun u pufakchali turlanish deb ataladi.

Dastur kodi:
# Bubble sort Python da
def bubbleSort(array):
for i in range(len(array)):
for j in range(0, len(array) - i - 1):
if array[j] > array[j + 1]:
temp = array[j]
array[j] = array[j + 1]
array[j + 1] = temp

data = [-2, 45, 0, 11, -9]

bubbleSort(data)

print('Sorted Array in Ascending Order:')

print(data)