-
Notifications
You must be signed in to change notification settings - Fork 0
/
insertintosortedll.c
64 lines (60 loc) · 1.06 KB
/
insertintosortedll.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
//Program to rean an array into linked list in C | Vishruth codes
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
} *root=NULL;
void create(int d)
{
struct node *temp,*p,*q;
temp=(struct node*)malloc(sizeof(struct node));
temp->data=d;
temp->next=NULL;
if(root==NULL)
{
root=temp;
}
else
{
p=root;
while(p && p->data<d)
{
q=p;
p=p->next;
}
if(p==root)
{
temp->next=root;
root=temp;
}
else{
temp->next=q->next;
q->next=temp;
}
}
}
void display()
{
struct node *p;
p=root;
printf("\nThe linked list: ");
while(p!=NULL)
{
printf("%d -> ",p->data);
p=p->next;
}
}
int main()
{
int len=6;
int ar[]={7,2,2,0,4,11};
printf("\nThe array: 7,2,2,0,4,11");
for(int i=0;i<len;i++)
{
create(ar[i]);
}
display();
return 0;
}