-
Notifications
You must be signed in to change notification settings - Fork 0
/
sorted.txt
71 lines (59 loc) · 1.17 KB
/
sorted.txt
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
65
66
67
68
69
70
71
#include<stdio.h>
typedef struct list List;
struct list
{
int data;
List* next;
};
void pr(List* head)
{
if(head == NULL)
printf("List is empty\n");
else
{
while(head!=NULL)
{
printf("%d ", head->data);
head = head->next;
}
}
}
void ins_sorted(List** head, int value)
{
List* temp = NULL;
List* node = malloc(sizeof(List));
node->data = value;
node->next = NULL;
if(*head == NULL || (*head)->data >= value)
{
node->next = *head;
*head = node;
}
else
{
temp = *head;
while(temp->next!=NULL)
{
if(temp->next->data > value)
{
node->next = temp->next;
temp->next = node;
return;
}
else
temp = temp->next;
}
temp->next = node;
}
}
int main()
{
List* head = NULL;
ins_sorted(&head, 20);
ins_sorted(&head, 1);
ins_sorted(&head, 2);
ins_sorted(&head, 10);
ins_sorted(&head, 1);
pr(head);
return 0;
}