forked from MAYANK25402/Hacktober-Fest-2022
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Bubble_sort_in_Linked _list.c
88 lines (63 loc) · 1.15 KB
/
Bubble_sort_in_Linked _list.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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
struct node *head=NULL;
//head = NULL;
void swap(struct node *prev, struct node* curr)
{
int temp;
temp=prev->data;
prev->data=curr->data;
curr->data=temp;
}
void sort()
{
struct node *prev=head;
struct node *curr=prev->next;
while(curr!=NULL)
{
if(curr->data<prev->data)
{
swap(prev,curr);
}
prev=prev->next;
curr=curr->next;
}
}
struct node *getnewnode(int v)
{
struct node *temp;
temp=(struct node*)malloc(sizeof(struct node));
temp->data=v;
return temp;
}
struct node *insertbeg(int val)
{
struct node *ptr;
ptr=getnewnode(val);
ptr->next=head;
head=ptr;
}
void display()
{
struct node *run;
while(run!=NULL)
{
printf("%d\n", run->data);
run=run->next;
}
}
void main()
{
insertbeg(3);
insertbeg(5);
insertbeg(2);
sort();
sort();
sort();
display();
}