void print(node** head)
{
for(node* p = head;p!=NULL;p = p->next)
printf("%d",p->data);
printf("\n");
}
int getlength(node** head)
{
int len = 0;
while(head != NULL)
{
head = head->next;
len++;
}
return len;
}
void insertBegin(node** head,int val)
{
node *newnode = new node();
newnode->data = val;
newnode->next = head;
head = newnode;
}
void insertEnd(node** head,int val)
{
node *newNode = new node();
newnode->data = val;
newnode->next = NULL;
if(head == NULL)
head = newnode;
else{
node *p = head;
while(p->next!=NULL)
p = p->next;
p->next = newnode;
}
}
void insert(node** head,int num)
{
if(head==NULL)
return;
node *p1 = head,*p2 = NULL;
while(p1->data<num && p1->next!=NULL)
{
p2 = p1;
p1 = p1->next;
}
node *p = new node();
p->data = num;
p->next = NULL;
if(p1->data<num)
{
p1->next = p;
}
else if(p1=head)
{
p->next = p1;
head = p;
}
else
{
p2->next = p;
p->next = p1;
}
}
void remove(node** head,int num)
{
if(head == NULL)
return;
node *p1 = head;
node *p2 = NULL;
while(p1->data != num && p1->next !=NULL)
{
p2 = p1;
p1 = p1->next;
}
if(p1->data!=num)
printf("%d not found\n",num);
else
{
if(p1==head)
{
head = p1->next;
delete p1;
}
else
{
p2->next = p1->next;
delete p1;
}
}
}
void bubblesort(node *head)
{
int len = 0;
for(node *p = head;p!=NULL;p=p->next) len++;
for(int i = 1;i<len;i++)
{
node *p = head;
for(int j = 0;j<len-i;j++,p=p->next)
if(p->data>p->next->data)
{
int temp = p->data;
p->data = p->next->data;
p->next->data = tem;
}
}
}