-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathсsort.c
81 lines (78 loc) · 1.34 KB
/
сsort.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
#include <stdio.h>
#include <malloc.h>
#include <string.h>
void csort(char *src, char *dest)
{
char ** buf = malloc(strlen(src)*sizeof(char *));
buf[0] = malloc(strlen(src)+1);
unsigned long j = 0;
unsigned long k = 0;
for (size_t i = 0; i < strlen(src);i++)
{
if(src[i] == ' ')
{
if (k!=0)
{
buf[j + 1] = malloc(strlen(src) + 1);
buf[j][k] = 0;
j++;
k = 0;
}
}
else
{
buf[j][k++] = src[i];
}
}
if(k != 0) buf[j][k] = 0;
j++;
unsigned long * key = malloc(j*sizeof(unsigned long));
for (int i = 0; i<j; i++)
{
key[i] = strlen(buf[i]);
}
unsigned long count[j];
memset(count, 0, j*sizeof(unsigned long));
for (unsigned long i = 0; i<j-1; i++)
{
for (unsigned long v = i+1; v<j; v++)
{
if (key[i]>key[v])
{
count[i] += 1;
}
else
{
count[v] += 1;
}
}
}
free(key);
k = 1;
char ** nbuf = malloc(j*sizeof(char *));
for (unsigned long i = 0; i<j;i++)
{
nbuf[count[i]] = malloc(strlen(buf[i])+1);
strcpy(nbuf[count[i]], buf[i]);
k += strlen(buf[i]);
free(buf[i]);
}
free(buf);
strcpy(dest, nbuf[0]);
free(nbuf[0]);
for (unsigned long i = 1; i<j;i++)
{
strcat(dest, " ");
strcat(dest, nbuf[i]);
free(nbuf[i]);
}
free(nbuf);
}
int main()
{
char s[] = "qqq www t aa rrr bb x y zz";
char * buf = malloc(strlen(s)+1);
csort(s, buf);
puts(buf);
return 0;
}