mahendrarathore1742

/build

mahendrarathore1742

/build

mahendrarathore1742

def LinearSearch(arr,x,n):
	for i in range(n):
		if arr[i]==x:
			return i;
	return -1;
arr=[5,3,9,34,56,77];
x=56;
n=len(arr);
obj=LinearSearch(arr,x,n);
if obj==-1:

mahendrarathore1742

            
pos=-1;
def binary_search(arr,n):
    l=0;
    r=len(arr);
    
    while l<=r:
        mid=(l+r)//2;
        
        if arr[mid]==n:

mahendrarathore1742

class node():
    def __init__(self,data=None):
        self.data=data;
        self.next=None;
    
class SinglyLinklist():
    def __init__(self):
        self.head=None;
    
    def display(self):

mahendrarathore1742

 def insertnode(self,newnode):
        Newnode=node(newnode);
        Newnode.next=self.head;
        self.head=Newnode;
            
 obj.insertnode(int(input('enter the item==')));

mahendrarathore1742

 def middleinsert(self,mid,newnode):
        Newnode=node(newnode);
        Newnode.next=mid.next;
        mid.next=Newnode
  
obj.middleinsert(obj.head.next,int(input('enter the item in middle in list==')));
obj.display()

mahendrarathore1742

def endinsert(self,newnode):
        Newnode=node(newnode);
        if self.head is None:
            self.head=Newnode;
            return True;
        last=self.head;
        while last.next is not None:
            last=last.next;
        last.next=Newnode;
        

mahendrarathore1742

def delete(self,remove):
        Head=self.head;
        if Head is not None:
            if Head.data==remove:
                self.head=Head.next;
                Head=None;
                return True;
        while Head is not None:
            if Head.data==remove:
                break;

mahendrarathore1742

class node():
    def __init__(self,data=None):
        self.data=data;
        self.next=None;
    
class SinglyLinklist():
    def __init__(self):
        self.head=None;
        
    def Insert(self,newnode):