-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSortingArrayOfStrings.c
More file actions
93 lines (76 loc) · 2.15 KB
/
SortingArrayOfStrings.c
File metadata and controls
93 lines (76 loc) · 2.15 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
// Question link - https://www.hackerrank.com/challenges/sorting-array-of-strings/problem?isFullScreen=true
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int lexicographic_sort(const char* a, const char* b) {
return strcmp(a,b);
}
int lexicographic_sort_reverse(const char* a, const char* b) {
return strcmp(b,a);
}
//count distinct character
int character_count(const char *s){
int n = 0;
int count[128] = {0};
if (NULL == s){
return -1;
}
while (*s != '\0') {
if (!count[*s]){
count[*s]++;
n++;
}
s++;
}
return n;
}
int sort_by_number_of_distinct_characters(const char* a, const char* b) {
int con = character_count(a) - character_count(b);
return (con ? con : lexicographic_sort(a, b));
}
int sort_by_length(const char* a, const char* b) {
int len = strlen(a) - strlen(b);
return (len ? len : lexicographic_sort(a, b));
}
void string_sort(char** arr,const int len,int (*cmp_func)(const char* a, const char* b)){
int con = 0;
while(!con){
con = 1;
for (int i = 0; i < len - 1; i++){
if (cmp_func(arr[i], arr[i+1]) > 0){
char *temp = arr[i];
arr[i] = arr [i+1];
arr[i + 1] = temp;
con = 0;
}
}
}
}
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");
}