-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsortingArrayOfStrings.c
More file actions
84 lines (77 loc) · 2.29 KB
/
Copy pathsortingArrayOfStrings.c
File metadata and controls
84 lines (77 loc) · 2.29 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
//Sorting Array of Strings
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
// Lexicographic sort (non-decreasing order)
int lexicographic_sort(const char* a, const char* b) {
return strcmp(a, b);
}
// Reverse lexicographic sort (non-increasing order)
int lexicographic_sort_reverse(const char* a, const char* b) {
return strcmp(b, a);
}
// Count the number of distinct characters in a string
#define CHARS 26
int distinct_chars(const char* a) {
int dist = 0;
int chars[CHARS] = {0};
while (*a != '\0') {
int chr = (*a++) - 'a';
if (chr < CHARS)
chars[chr]++;
}
for (int i = 0; i < CHARS; i++)
if (chars[i])
dist++;
return dist;
}
// Sort by number of distinct characters
int sort_by_number_of_distinct_characters(const char* a, const char* b) {
int res = distinct_chars(a) - distinct_chars(b);
return (res) ? res : lexicographic_sort(a, b);
}
// Sort by length
int sort_by_length(const char* a, const char* b) {
int res = strlen(a) - strlen(b);
return (res) ? res : lexicographic_sort(a, b);
}
// Simple bubble sort for strings
void string_sort(char** arr, const int len, int (cmp_func)(const char a, const char* b)) {
for (int i = 0; i < len; i++) {
for (int j = 0; j < len - i - 1; j++) {
if (cmp_func(arr[j], arr[j + 1]) > 0) {
char* temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
int main()
{
int n;
scanf("%d", &n);
char** arr;
arr = (char*)malloc(n * sizeof(char));
for(int i = 0; i < n; i++){
*(arr + i) = malloc(1024 * sizeof(char));
scanf("%s", *(arr + i));
(arr + i) = realloc((arr + i), strlen(*(arr + i)) + 1);
}
string_sort(arr, n, lexicographic_sort);
for(int i = 0; i < n; i++)
printf("%s\n", arr[i]);
printf("\n");
string_sort(arr, n, lexicographic_sort_reverse);
for(int i = 0; i < n; i++)
printf("%s\n", arr[i]);
printf("\n");
string_sort(arr, n, sort_by_length);
for(int i = 0; i < n; i++)
printf("%s\n", arr[i]);
printf("\n");
string_sort(arr, n, sort_by_number_of_distinct_characters);
for(int i = 0; i < n; i++)
printf("%s\n", arr[i]);
printf("\n");
}