// Created by H. Ahmadian /* Program To Sort User Entered Strings. This Program is Very Simple and Straightforward. I have Used Dynamic Memory Allocation for Strings Manipulation instead of Arrays with Fixed and Predetermined Length, In Order To Improve Efficiency and Effective Use. There Is No Any Limit To The Input String Size, Because Input String Allocated Character by Character Dynamically At The Runtime. Sometimes, Program may Output for Long Strings! I Don't Know Exactly Why, But It seems SoloLearn Compiler Can't Handle Such Long Strings, So Just Try It Again. */ /* Given a String as Input, Output its Characters Alphabetically Sorted From A to Z. For Example: Input: challenge Output: aceeghlln Number should go First: Input: happy42 Output: 24ahppy Special Characters, such as Symbols, go before Numbers and Letters: Input: $tar3 Output: $3art Whitespaces should be ignored */ #include #include #include char* parsing (char*); char* Sort_Number(char*); char* Sort_Alphabet(char*); char* Sort_Symbol(char*); char* Final (char*, char*, char*); size_t bufsz = 1; char* Input_String (void) { int i = 0; char character; char* input; char* temp; input = (char *) malloc(sizeof(char)); if(input == NULL) { printf("Could Not Allocate Memory!"); exit(1); } while((character = getchar()) != EOF) { temp = realloc(input, ++bufsz * (sizeof(char))); input = temp; input[i++] = character; } input[i] = '\0'; printf("%s \n" , input); return input; } char* RemoveSpaces(char* source) { char* i = source; char* j = source; while(*j != 0) { *i = *j++; if(*i != ' ') i++; } *i = 0; return source; } int main() { printf ("\n Enter String---> "); printf ("\n\n\n Finaly! Your Sorted String: %s", parsing(Input_String())); return 0; } char* parsing (char* string) { int a, n, s; a = n = s = 0; char* temp; printf("\n Your String: %s\n\n" , string); string = RemoveSpaces(string); printf("\n Your String After Rmoving Spaces: %s\n\n" , string); char* symbol = (char*) malloc(sizeof(char)); char* number = (char*) malloc(sizeof(char)); char* alphabet = (char*) malloc(sizeof(char)); if(!(symbol) || !(number) || !(alphabet)) { printf("Memory Allocation Failed!"); exit(1); } for(int i = 0; i < strlen(string); i++) { if((string[i] >= 'a' && string[i] <= 'z') || (string[i] >= 'A' && string[i] <= 'Z')) { temp = realloc(alphabet, (sizeof(char))); alphabet = temp; alphabet[a++] = string[i]; } else if(string[i] >= '0' && string[i] <= '9') { temp = realloc(number, (sizeof(char))); number = temp; number[n++] = string[i]; } else { temp = realloc(symbol, (sizeof(char))); symbol = temp; symbol[s++] = string[i]; } } *(alphabet + a) = *(number + n) = *(symbol + s) = 0; printf("\n\n\n Your String After Parsing To Symbols, Numbers and Alphabets:\n"); return ( Final (symbol, number, alphabet) ); } void RvereseArray(char arr[], int start, int end) { int temp; while (start < end) { temp = arr[start]; arr[start] = arr[end]; arr[end] = temp; start++; end--; } } char* Sort_Number(char* number) { int key, j; for (int i = 1; i < strlen(number); i++) { key = number[i]; j = i - 1; while (j >= 0 && number[j] > key) { number[j + 1] = number[j]; j = j - 1; } number[j + 1] = key; } // RvereseArray(number,0, strlen(number)-1); return number; } char* Sort_Alphabet(char* alphabet) { char temp; for(int i = 0; i < strlen(alphabet) - 1; i++) { for(int j = i + 1; j < strlen(alphabet); j++) { if (alphabet[i] > alphabet[j]) { temp = alphabet[i]; alphabet[i] = alphabet[j]; alphabet[j] = temp; } } } return alphabet; } char* Sort_Symbol(char* symbol) { char temp; for(int i = 0; i < strlen(symbol) - 1; i++) { for(int j = i + 1; j < strlen(symbol); j++) { if (symbol[i] > symbol[j]) { temp = symbol[i]; symbol[i] = symbol[j]; symbol[j] = temp; } } } return symbol; } char* Final (char* symbol, char* number, char* alphabet) { int s, n, a; int Length = strlen(symbol) + strlen(number) + strlen(alphabet); char* Sort_String; Sort_String = (char*) malloc(++Length * sizeof(char)); printf("\n SYMBOLS: %13s\t <=> ", symbol); if(strlen(symbol) > 0) symbol = Sort_Symbol(symbol); printf("%s \n", symbol); printf(" NUMBERS: %13s\t <=> ", number); number = Sort_Number (number); printf("%s \n", number); printf("ALPHABET: %13s\t <=> ", alphabet); if(strlen(alphabet) > 0) alphabet = Sort_Alphabet (alphabet); printf("%s \n\n\n", alphabet); for(s = 0; symbol[s] != '\0'; ++s) Sort_String[s] = *(symbol + s); for(n = 0; number[n]; ++n) Sort_String[s++] = *(number + n); for(a = 0; alphabet[a]; ++a) Sort_String[s++] = *(alphabet + a); Sort_String[s] = '\0'; return Sort_String; }

QA Help - Sort String