Day 8 of 100 Days of Python

Today is Day 8 of the 100 Days of Python. Today, I created a Bubble Sort problem.

# Bubble Sort
a = []
n = int(input("Enter the no. of values in the list"))
print("Enter values of the list ")
for i in range(0,n):
    v = int(input())
    a.append(v)
print("This is current list:")
print(a)
for i in range(0, n):
    for j in range(0,n-1):
        if a[j]>a[j+1]:
            a[j], a[j+1] = a[j+1], a[j]
    print(f"List after iteration {i}:")
    print(a)

print("List sorted in ascending order:")
print(a)

The second program I made was Binary Search.

# Binary Search
a = [11, 22, 25, 34, 64, 90]
ns = int(input("Enter the number to be searched"))
found = False
l = 0
h = len(a) - 1
while l<=h and found == False:
    mid = (l+h)//2
    if a[mid] == ns:
        found = True
        print(f"Found at index {mid}")
    elif ns>a[mid]:
        l = mid +1
    elif ns<a[mid]:
        h = mid -1
if not found:
    print("not found")