-
Notifications
You must be signed in to change notification settings - Fork 0
/
sorting_array_of_strings_arsho.c
101 lines (86 loc) · 2.52 KB
/
sorting_array_of_strings_arsho.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
/*
Title : Sorting Array of Strings
Category : Functions
Author : arsho
Created : 02 May 2020
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int get_number_of_distinct_characters(const char* a){
int is_letter_used[26] = {0};
int i, total_distinct_characters = 0;
for(i=0;i<strlen(a);i++){
if(a[i]>='a' && a[i]<='z')
is_letter_used[a[i]-'a']=1;
}
for(i=0;i<26;i++){
total_distinct_characters += is_letter_used[i];
}
return total_distinct_characters;
}
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);
}
int sort_by_number_of_distinct_characters(const char* a, const char* b) {
int i;
int distinct_characters_a = get_number_of_distinct_characters(a);
int distinct_characters_b = get_number_of_distinct_characters(b);
//printf("%s %d, %s %d\n", a, unique_a_total, b, unique_b_total);
if(distinct_characters_a == distinct_characters_b){
return lexicographic_sort(a, b);
}
return distinct_characters_a > distinct_characters_b;
}
int sort_by_length(const char* a, const char* b) {
int strlen_a = strlen(a);
int strlen_b = strlen(b);
if(strlen_a == strlen_b){
return lexicographic_sort(a, b);
}
return strlen_a > strlen_b;
}
void string_sort(char** arr,const int len,int (*cmp_func)(const char* a, const char* b)){
int i, j;
for(i=0;i<len-1;i++){
for(j=i+1;j<len;j++){
if((*cmp_func)(arr[i], arr[j])>0){
char* temp;
temp = arr[i];
arr[i] = arr[j];
arr[j] = 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");
}