-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path27listReverse.c
executable file
·140 lines (135 loc) · 2.57 KB
/
27listReverse.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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#include<stdio.h>
#include<malloc.h>
struct node{
int data;
struct node *next;
};
void createNode(struct node**);
void LLCopy(struct node**,struct node**);
void display(struct node*);
int count(struct node*);
int sortDsc(struct node**);
int copyDsc(struct node**,struct node**);
int listReverse(struct node**);
int main(){
int itr1,num;
struct node* src=NULL;
struct node* dest=NULL;
printf("Enter no. of nodes to be created.\n");
scanf("%d",&num);
for(int itr1=0;itr1<num;itr1++){
createNode(&src);
}
printf("Source Linked List: ");
display(src);
listReverse(&src);
display(src);
return 0;
}
int listReverse(struct node** head){
struct node* cur=*head;
struct node* prev=NULL;
struct node* next=NULL;
if(*head!=NULL){
while(cur->next!=NULL){
next=cur->next;
cur->next=prev;
prev=cur;
cur=next;
}
cur->next=prev;
*head=cur;
}else{
printf("List is empty.\n");
return -1;
}
return 0;
}
int copyDsc(struct node **src,struct node** dest){
if(*src==NULL){
printf("No linked list to copy.\n");
return -1;
}else{
LLCopy(src,dest);
sortDsc(dest);
}
return 0;
}
int sortDsc(struct node** src){
struct node* temp1=*src;
struct node* temp2=*src;
int data;
while(temp1->next!=NULL){
temp2=*src;
while(temp2->next!=NULL){
if(temp2->data<temp2->next->data){
data=temp2->data;
temp2->data=temp2->next->data;
temp2->next->data=data;
}
temp2=temp2->next;
}
temp1=temp1->next;
}
}
void LLCopy(struct node **src,struct node **dest){
struct node *stemp,*dtemp;
stemp=*src;
dtemp=*dest;
struct node *newNode=NULL;
while(stemp!=NULL){
dtemp=*dest;
newNode=(struct node*)malloc(sizeof(struct node));
newNode->data=stemp->data;
newNode->next=NULL;
if(*dest==NULL){
*dest=newNode;
}else{
while(dtemp->next!=NULL){
dtemp=dtemp->next;
}
dtemp->next=newNode;
}
stemp=stemp->next;
}
}
void display(struct node *head){
struct node *temp=head;
if(*head==NULL){
printf("List is empty.\n");
return;
}
printf("OUTPUT: \n");
while(temp->next!=NULL){
printf("|%d|->",temp->data);
temp=temp->next;
}
printf("|%d|",temp->data);
}
void createNode(struct node **head){
struct node *temp=*head;
struct node *newNode=(struct node*)malloc(sizeof(struct node));
printf("Enter data");
scanf("%d",&newNode->data);
newNode->next=NULL;
if(*head==NULL){
*head=newNode;
}else{
while(temp->next!=NULL){
temp=temp->next;
}
temp->next=newNode;
}
}
int count(struct node *head){
struct node *temp=head;
int cnt=1;
if(head==NULL){
return 0;
}
while(temp->next!=NULL){
cnt++;
temp=temp->next;
}
return cnt;
}