• include include using namespace std; int recurSum(int n) { if (n > 0)
  • { cout else if(n
  • Ma’lumotlar tuzilmasi va algoritmlar fanining maqsad va vazifasini izohlab bering




    Download 1.85 Mb.
    bet53/56
    Sana24.02.2022
    Hajmi1.85 Mb.
    #18040
    1   ...   48   49   50   51   52   53   54   55   56
    Bog'liq
    MTA Yakuniy nazorat Hammasi
    Diskret tuzilmalar 1-M.Ish, 2 5359587219348652922, ARXEOLOGIYADA ANIQ VA TABIIY FANLAR, Falsafa 1-mustaqil ish, ELEKTRON TIJORAT VA BIZNES ASOSLAR, 1-LAB OCHILOV AZIZBEK, 6-amaliy iah Tarmoqlararo ekran vositasi yordamida tarmoq himoy, Aliyev-Tizimli dasturiy taminot, @idum uz tavsifnoma namunasi, TURIZMDA TUROPERATORLIK FAOLIYATINI RIVOJLANTIRISH, TURIZMDA TUROPERATORLIK, Biznesniloyihalash, 1665071471, Axborot xavfsizligi yakuniy testla
    { if (l < r)
    {
    // Xuddi shunday (l + r) / 2, lekin to'ldirishni oldini oladi
    // katta l va h
    int m = l+(r-l)/2;
    // Birinchi va ikkinchi yarmlarni tartiblash
    mergeSort(mass, l, m);
    mergeSort(mass, m+1, r);
    merge(mass, l, m, r);
    }
    }


    void printMassay(int A[], int size)
    {for (int i=size-1;i>=0;i--) printf("%d ", A[i]); printf("\n");}


    int main()
    {
    int mass[] = {5, 4, 18, 7, 50, 7};
    int mass_size = sizeof(mass)/sizeof(mass[0]);


    printf("Berilgan massiv: \n");
    printMassay(mass, mass_size);
    mergeSort(mass, 0, mass_size - 1);
    printf("\nSaralangan massiv: \n");
    printMassay(mass, mass_size);
    return 0;
    }


    18. N natural son berilgan. 1 dan N gacha bo'lgan barcha natural sonlarning kvadratlari yig’indisini rekursiv funksiya yordamida chop eting.
    #include
    #include
    using namespace std;


    int recurSum(int n)
    {
    if (n > 0)
    return pow(n,2) + recurSum(n - 1);
    }


    int main()
    {
    int N;cout<<"N:";cin>>N;
    cout << recurSum(N);
    return 0;
    }


    19. Ikkita A va B butun sonlar berilgan (har biri alohida satrda). A dan B gacha bo'lgan barcha sonlarni, agar A

    #include
    using namespace std;


    int kamayish(int n, int m)
    {
    if (n>m)
    { cout<
    else if(n

    Download 1.85 Mb.
    1   ...   48   49   50   51   52   53   54   55   56




    Download 1.85 Mb.

    Bosh sahifa
    Aloqalar

        Bosh sahifa



    Ma’lumotlar tuzilmasi va algoritmlar fanining maqsad va vazifasini izohlab bering

    Download 1.85 Mb.