Page 6 - DATA STRUCTURE-LISTS

def Delete(L, x):
try:
L.remove(x)
print("Element removed")
except ValueError:
print("\nElement not found")
L=[12, 9, 99, 45, 36, 72]
print("\nOriginal List: ", L)
x=int(input("\nEnter number to delete: "))
Delete(L, x)
print("\nUpdated List: ", L)

Deletion from a Sorted List
def BinarySearch(L,item):
beg=0
end=len(L)-1
while beg<=end:
mid=(beg+end)//2
if L[mid]==item:
return mid
elif L[mid]>item:
end=mid-1
else:
beg=mid+1
return -1
def Delete(L, x):
pos=BinarySearch(L, x)
if pos==-1:
print("Element not found")
else:
del L[pos]
return pos
L=[11, 22, 33, 44, 55, 66]
print("Original list is: ", L)
x=int(input("\nEnter the element to delete: "))
pos=Delete(L, x)
if pos!=-1:
print("\nUpdated list is: ", L)