Dinamik xotira

#include <stdio.h>
#include <stdlib.h>

int main(void) {
    int soni = 5;

    int *massiv = malloc(soni * sizeof(int));

    if (massiv == NULL) {
        printf("Xotira ajratilmadi!\n");
        return 1;
    }

    for (int i = 0; i < soni; i++) {
        massiv[i] = (i + 1) * 10;
    }

    for (int i = 0; i < soni; i++) {
        printf("massiv[%d] = %d\n", i, massiv[i]);
    }

    free(massiv);        /* xotirani qaytaramiz */
    massiv = NULL;       /* ko'rsatkichni tozalaymiz */

    return 0;
}

#include <stdio.h>
#include <stdlib.h>

int main(void) {
    int soni = 5;

    int *m1 = malloc(soni * sizeof(int));    /* axlat qiymatlar */
    int *m2 = calloc(soni, sizeof(int));     /* hammasi nol */

    if (m1 == NULL || m2 == NULL) {
        free(m1);
        free(m2);
        return 1;
    }

    printf("calloc bergan qiymatlar: ");
    for (int i = 0; i < soni; i++) {
        printf("%d ", m2[i]);
    }
    printf("\n");

    free(m1);
    free(m2);

    return 0;
}

#include <stdio.h>
#include <stdlib.h>

int main(void) {
    int sigim = 3;
    int *massiv = malloc(sigim * sizeof(int));

    if (massiv == NULL) {
        return 1;
    }

    for (int i = 0; i < sigim; i++) {
        massiv[i] = i + 1;
    }

    /* joy yetmadi - kengaytiramiz */
    int yangi_sigim = 6;
    int *vaqtinchalik = realloc(massiv, yangi_sigim * sizeof(int));

    if (vaqtinchalik == NULL) {
        free(massiv);        /* eski xotira hali ham bizda */
        return 1;
    }

    massiv = vaqtinchalik;

    for (int i = sigim; i < yangi_sigim; i++) {
        massiv[i] = i + 1;
    }

    printf("Kengaytirilgan massiv: ");
    for (int i = 0; i < yangi_sigim; i++) {
        printf("%d ", massiv[i]);
    }
    printf("\n");

    free(massiv);
    return 0;
}

#include <stdio.h>
#include <stdlib.h>

int main(void) {
    int sigim = 2;
    int soni = 0;
    int *sonlar = malloc(sigim * sizeof(*sonlar));

    if (sonlar == NULL) {
        return 1;
    }

    for (int qiymat = 10; qiymat <= 100; qiymat += 10) {
        if (soni == sigim) {
            sigim *= 2;                 /* joyni ikki barobar oshiramiz */
            int *yangi = realloc(sonlar, sigim * sizeof(*sonlar));

            if (yangi == NULL) {
                free(sonlar);
                return 1;
            }

            sonlar = yangi;
            printf("Sig'im %d ga oshirildi\n", sigim);
        }

        sonlar[soni++] = qiymat;
    }

    printf("Natija (%d ta): ", soni);
    for (int i = 0; i < soni; i++) {
        printf("%d ", sonlar[i]);
    }
    printf("\n");

    free(sonlar);
    return 0;
}

#include <stdio.h>
#include <stdlib.h>

int main(void) {
    int soni = 7;          /* amalda bu scanf orqali o'qiladi */

    double *ballar = malloc((size_t) soni * sizeof(*ballar));

    if (ballar == NULL) {
        fprintf(stderr, "Xotira yetmadi\n");
        return 1;
    }

    for (int i = 0; i < soni; i++) {
        ballar[i] = 60.0 + i * 5.5;
    }

    double yigindi = 0.0;
    for (int i = 0; i < soni; i++) {
        yigindi += ballar[i];
    }

    printf("%d ta ball uchun o'rtacha: %.2f\n", soni, yigindi / soni);

    free(ballar);
    return 0;
}

#include <stdio.h>
#include <stdlib.h>

int main(void) {
    int qatorlar = 3;
    int ustunlar = 4;

    /* qatorlarga ko'rsatkichlar massivi */
    int **jadval = malloc(qatorlar * sizeof(*jadval));

    if (jadval == NULL) {
        return 1;
    }

    for (int i = 0; i < qatorlar; i++) {
        jadval[i] = malloc(ustunlar * sizeof(**jadval));

        if (jadval[i] == NULL) {
            for (int j = 0; j < i; j++) {
                free(jadval[j]);        /* oldingilarini tozalaymiz */
            }
            free(jadval);
            return 1;
        }
    }

    int hisob = 1;
    for (int i = 0; i < qatorlar; i++) {
        for (int j = 0; j < ustunlar; j++) {
            jadval[i][j] = hisob++;
        }
    }

    for (int i = 0; i < qatorlar; i++) {
        for (int j = 0; j < ustunlar; j++) {
            printf("%4d", jadval[i][j]);
        }
        printf("\n");
    }

    /* teskari tartibda ozod qilamiz */
    for (int i = 0; i < qatorlar; i++) {
        free(jadval[i]);
    }
    free(jadval);

    return 0;
}

void sizadi(void) {
    int *massiv = malloc(1000 * sizeof(int));
    /* free chaqirilmadi - xotira yo'qoldi */
}

# Valgrind bilan (Linux / macOS)
gcc -std=c17 -g dastur.c -o dastur
valgrind --leak-check=full ./dastur

==12345== HEAP SUMMARY:
==12345==     in use at exit: 4,000 bytes in 1 blocks
==12345==   total heap usage: 1 allocs, 0 frees, 4,000 bytes allocated
==12345==
==12345== 4,000 bytes in 1 blocks are definitely lost in loss record 1 of 1
==12345==    at 0x4C2FB0F: malloc
==12345==    by 0x108668: sizadi (dastur.c:5)

# AddressSanitizer bilan (GCC va Clang da o'rnatilgan)
gcc -std=c17 -g -fsanitize=address,undefined dastur.c -o dastur
./dastur

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

char *nusxa_yarat(const char *manba) {
    size_t uzunlik = strlen(manba);
    char *nusxa = malloc(uzunlik + 1);      /* +1 nol uchun */

    if (nusxa == NULL) {
        return NULL;
    }

    strcpy(nusxa, manba);
    return nusxa;                            /* chaqiruvchi free qiladi */
}

int main(void) {
    char *ism = nusxa_yarat("Husanboy Qodirov");

    if (ism == NULL) {
        return 1;
    }

    printf("Nusxa: %s\n", ism);
    ism[0] = 'X';
    printf("O'zgartirildi: %s\n", ism);

    free(ism);
    return 0;
}