-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsortTree.c
More file actions
295 lines (249 loc) · 6.78 KB
/
Copy pathsortTree.c
File metadata and controls
295 lines (249 loc) · 6.78 KB
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
#include "tree.h"
//To find middle node in a linked list in single traversal
node* midNode(tnode p) {
if(p == NULL || p->next_ptr == NULL)
return p;
node *fast = p;
node *slow = p;
while(fast->next_ptr && fast->next_ptr->next_ptr) {
slow = slow->next_ptr;
fast = fast->next_ptr->next_ptr;
}
//returning pointer to middle node
return slow;
}
/* --- sort alphabetically ----*/
//To merge two sorted linked lists
tnode MergeTwoSLL_alpha(tnode L1, tnode L2) {
//if any one list is empty and other non-empty then return non-empty
//if both empty then return NULL
if(!L1 || !L2)
return L1 != NULL ? L1 : L2;
node *p = L1, *q = L2, *r = NULL;
node *head = NULL;
//to set head pointer
if(strcasecmp(p->fname, q->fname) < 0) {
head = p;
r = p;
p = p->next_ptr;
}
else {
head = q;
r = q;
q = q->next_ptr;
}
while(p && q) {
//comparing file names
if(strcasecmp(p->fname, q->fname) < 0) {
r->next_ptr = p;
p = p->next_ptr;
}
else {
r->next_ptr = q;
q = q->next_ptr;
}
r = r->next_ptr;
}
if(p)
r->next_ptr = p;
if(q)
r->next_ptr = q;
return head;
}
//Merge sort
tnode mergeSort_alpha(tnode head) {
//if head is NULL or only one node present in linked list then return
if(head == NULL || head->next_ptr == NULL)
return head;
//find middle node and make two separate linked lists
node *mid = midNode(head);
node *Nhead = mid->next_ptr;
mid->next_ptr = NULL;
//recursive call for two separated linked lists
node *l1 = mergeSort_alpha(head);
node *l2 = mergeSort_alpha(Nhead);
return MergeTwoSLL_alpha(l1, l2);
}
tnode sort_alpha(tnode pt) {
node *sorted = mergeSort_alpha(pt);
node *p = sorted;
//to sort subdirectory entries
while(p) {
if(p->inner_ptr)
p->inner_ptr = sort_alpha(p->inner_ptr);
p = p->next_ptr;
}
return sorted;
}
/* ---------------------------------------------------------------------------- */
/* --- sort reverse alphabetically ----*/
//To merge two sorted linked lists
tnode MergeTwoSLL_rev_alpha(tnode L1, tnode L2) {
//if any one list is empty and other non-empty then return non-empty
//if both empty then return NULL
if(!L1 || !L2)
return L1 != NULL ? L1 : L2;
node *p = L1, *q = L2, *r = NULL;
node *head = NULL;
//to set head pointer
if(strcasecmp(p->fname, q->fname) > 0) {
head = p;
r = p;
p = p->next_ptr;
}
else {
head = q;
r = q;
q = q->next_ptr;
}
while(p && q) {
//comparing file names
if(strcasecmp(p->fname, q->fname) > 0) {
r->next_ptr = p;
p = p->next_ptr;
}
else {
r->next_ptr = q;
q = q->next_ptr;
}
r = r->next_ptr;
}
if(p)
r->next_ptr = p;
if(q)
r->next_ptr = q;
return head;
}
//Merge sort
tnode mergeSort_rev_alpha(tnode head) {
//if head is NULL or only one node present in linked list then return
if(head == NULL || head->next_ptr == NULL)
return head;
//find middle node and make two separate linked lists
node *mid = midNode(head);
node *Nhead = mid->next_ptr;
mid->next_ptr = NULL;
//recursive call for two separated linked lists
node *l1 = mergeSort_rev_alpha(head);
node *l2 = mergeSort_rev_alpha(Nhead);
return MergeTwoSLL_rev_alpha(l1, l2);
}
tnode sort_rev_alpha(tnode pt) {
node *sorted = mergeSort_rev_alpha(pt);
node *p = sorted;
//to sort subdirectory entries
while(p) {
if(p->inner_ptr)
p->inner_ptr = sort_rev_alpha(p->inner_ptr);
p = p->next_ptr;
}
return sorted;
}
/* ---------------------------------------------------------------------------- */
/* --- sort by last time modification ----*/
//To merge two sorted linked lists
tnode MergeTwoSLL_last_mod(tnode L1, tnode L2) {
//if any one list is empty and other non-empty then return non-empty
//if both empty then return NULL
if(!L1 || !L2)
return L1 != NULL ? L1 : L2;
node *p = L1, *q = L2, *r = NULL;
node *head = NULL;
//to set head pointer
if(!last_mod_compare(p, q)) {
head = p;
r = p;
p = p->next_ptr;
}
else {
head = q;
r = q;
q = q->next_ptr;
}
while(p && q) {
//comparing file names
if(!last_mod_compare(p, q)) {
r->next_ptr = p;
p = p->next_ptr;
}
else {
r->next_ptr = q;
q = q->next_ptr;
}
r = r->next_ptr;
}
if(p)
r->next_ptr = p;
if(q)
r->next_ptr = q;
return head;
}
//Merge sort
tnode mergeSort_last_mod(tnode head) {
//if head is NULL or only one node present in linked list then return
if(head == NULL || head->next_ptr == NULL)
return head;
//find middle node and make two separate linked lists
node *mid = midNode(head);
node *Nhead = mid->next_ptr;
mid->next_ptr = NULL;
//recursive call for two separated linked lists
node *l1 = mergeSort_last_mod(head);
node *l2 = mergeSort_last_mod(Nhead);
return MergeTwoSLL_last_mod(l1, l2);
}
tnode sort_last_mod(tnode pt) {
node *sorted = mergeSort_last_mod(pt);
node *p = sorted;
//to sort subdirectory entries
while(p) {
if(p->inner_ptr)
p->inner_ptr = sort_last_mod(p->inner_ptr);
p = p->next_ptr;
}
return sorted;
}
//comparing last modification time details
//comparing in this sequence => year - month - date - hour - minute - seconds - file name
int last_mod_compare(tnode n1, tnode n2) {
if(n1->info.last_mod.fyear > n2->info.last_mod.fyear)
return 1;
else if(n1->info.last_mod.fyear < n2->info.last_mod.fyear)
return 0;
else {
if(n1->info.last_mod.fmon > n2->info.last_mod.fmon)
return 1;
else if(n1->info.last_mod.fmon < n2->info.last_mod.fmon)
return 0;
else {
if(n1->info.last_mod.fdate > n2->info.last_mod.fdate)
return 1;
else if(n1->info.last_mod.fdate < n2->info.last_mod.fdate)
return 0;
else {
if(n1->info.last_mod.fhour > n2->info.last_mod.fhour)
return 1;
else if(n1->info.last_mod.fhour < n2->info.last_mod.fhour)
return 0;
else {
if(n1->info.last_mod.fmin > n2->info.last_mod.fmin)
return 1;
else if(n1->info.last_mod.fmin < n2->info.last_mod.fmin)
return 0;
else {
if(n1->info.last_mod.fsec > n2->info.last_mod.fsec)
return 1;
else if(n1->info.last_mod.fsec < n2->info.last_mod.fsec)
return 0;
else {
if(strcasecmp(n1->fname, n2->fname) >= 0)
return 1;
else
return 0;
}
}
}
}
}
}
}