Merry C++hristmas

#define _CRT_SECURE_NO_WARNINGS
#include <cstdlib>
#include <stdio.h>
#include <string.h>
#include <ctype.h>

using namespace std;

void letter();
void word();
void line();

void securePointer(void*);
void secureFile(FILE*);

char* makeArray(int);
char** make2DArray(int, int);

int str_comp(const void* p1, const void* p2);


int main()
{
    letter();
    word();
    line();
}

char* makeArray(int n)
{
    char* c = (char*)malloc(n * sizeof(char));
    return c;
}

char** make2DArray(int n, int m)
{
    char** c = (char**)malloc(256 * sizeof(char*));
    securePointer(c);
    for (int i = 0; i < 256; i++) {
        c[i] = (char*)malloc(256 * sizeof(char));
        securePointer(c[i]);
    }
    return c;
}

int char_comp(const void* p1, const void* p2) {
    char* char1 = (char*)p1;
    char* char2 = (char*)p2;
    return strcmp(char1, char2);
}

int str_comp(const void* p1, const void* p2) {
    char** str1 = (char**)p1;
    char** str2 = (char**)p2;
    return strcmp(*str1, *str2);
}

void securePointer(void* ptr)
{
    if (ptr == nullptr)
    {
        puts("Nem sikerult letrehozni a pointer-t.");
        exit(43);
    }
}

void secureFile(FILE* file)
{
    if (!file)
    {
        puts("Nem sikerult megnyitani az allomanyt.");
        exit(43);
    }
}

void line() {

    //Valtozok deklaralasa
    int i, j;
    FILE* f, * g;


    //Mondatos tomb lefoglalasa
    char** c = make2DArray(256, 256);


    //Mondatok beolvasasa a tomb elemei kent
    f = fopen("be.txt", "rt");
    secureFile(f);

    int size_c = 0;
    while (!feof(f)) {
        fgets(c[size_c], 255, f);
        size_c++;
    }

    fclose(f);


    //Tomb rendezese ABC sorrendben quicksorttal
    qsort(c, size_c, sizeof(char*), str_comp);


    //A '\n' karakterek kiszedese
    for (i = 0; i < size_c; i++) {
        for (j = 0; j < strlen(c[i]); j++) {
            if (c[i][j] == '\n') {
                c[i][j] = '\0';
                break;
            }
        }

    }


    //A mondatok kiirasa a c.txt fileba
    g = fopen("c.txt", "wt");
    secureFile(g);
    for (i = 0; i < size_c; i++) {
        if (i == size_c - 1) {
            fprintf(g, "%s", c[i]);
        }
        else {
            fprintf(g, "%s\n", c[i]);
        }
    }

    fclose(g);

}


void word() {

    //Valtozok deklaralasa
    int i;
    FILE* f, * g;


    //Szavas tomb lefoglalasa
    char** b = make2DArray(256, 256);


    //Szavak beolvasasa a tomb elemei kent
    f = fopen("be.txt", "rt");
    secureFile(f);

    int size_b = 0;
    while (fscanf(f, "%s", b[size_b]) != EOF) {
        size_b++;
    }

    fclose(f);


    //Tomb rendezese ABC sorrendben quicksorttal
    qsort(b, size_b, sizeof(char*), str_comp);


    //A szavak kiirasa a c.txt fileba
    g = fopen("b.txt", "wt");
    secureFile(g);

    for (i = 0; i < size_b; i++) {
        if (i == size_b - 1) {
            fprintf(g, "%s", b[i]);
        }
        else {
            fprintf(g, "%s\n", b[i]);
        }
    }

    fclose(g);

}

void letter() {

    //Valtozok deklaralasa
    int i;
    FILE* f, * g;


    //Betus tomb lefoglalasa
    char* a = makeArray(65536);


    //Betuk beolvasasa a tomb elemei kent
    f = fopen("be.txt", "rt");
    secureFile(f);
    int size_a = 0;
    while (fscanf(f, "%c", &a[size_a]) != EOF) {
        size_a++;
    }

    fclose(f);


    //A ' ' es '\n' karakter kiszedese
    for (i = 0; i < size_a; i++) {
        if (a[i] == ' ' || a[i] == '\n') {
            for (int j = i; j < size_a; j++) {
                a[j] = a[j + 1];
            }
            size_a--;
        }
    }


    //Tomb rendezese ABC sorrendben quicksorttal
    qsort(a, size_a, sizeof(char), char_comp);


    //A betuk kiirasa az a.txt fileba
    g = fopen("a.txt", "wt");
    secureFile(g);

    for (i = 0; i < size_a; i++) {
        fprintf(g, "%c", a[i]);
    }

    fclose(g);

}