• Navbatdagi asosiy amallar
  • Dekdagi asosiy amallar
  • 8-Mavzu: Stek va navbatlar To‘plam




    Download 0.52 Mb.
    bet4/5
    Sana07.11.2023
    Hajmi0.52 Mb.
    #95008
    1   2   3   4   5
    Bog'liq
    8-Mavzu
    Reja Diniy va milliy qadriyatlarning tiklanishi-azkurs.org, КРОССВОРД НА ТЕМУ СТОМАТОЛОГИЯ, ingliz tili yakuniy, 7 t amaliy fizika, 6 amaliy mashgulot, 5 amaliy, Muslim 0123, Axborot-texnologiyalari-Kadirov (1), Malumotlar bazasi fanidan Mustaqil ish (1), Mundarij a kirish I bob. Gap bo‘laklari haqida umumiy ma’lumotla-fayllar.org, Polynomial, глоссарий, aiahhashhshsshhshshsgsg, psixologiya mustaqil ish
    void Empty(int t)
    {
    if (t= =0) p=1;
    else p=2;
    }
    void Push(int t, BT x)
    {
    if (t= =max_st) exit(1);
    stack[t]=x;
    t++;
    }
    void Remove(int t)
    {
    if (t= =0) exit(1);
    t--;
    return stack[t];
    }
    void Full(int t)
    {
    if (t= =max_st) p=1;
    else p=2;
    }

    Navbatdagi asosiy amallar

    Faraz qilaylik, navbat bir o‘lchamli massiv ko‘rinishida ifodalangan bo‘lib uning uzunligi max_q ga teng bo‘lsin, ya’ni queue[max_q]. Bu erda first –navbat boshi, last navbat oxiri, x esa BT turga tegishli element.


    void Empty(int first, last)
    {
    if (first= =last) p=1;
    else p=2;
    }
    void Insert(int last, BT x)
    {
    if (last= =max_q) exit(1);
    queue[last]=x;
    last++;
    }
    void Remove(int first, last)
    {
    if (first= =last) exit(1);
    first++;
    }
    void Full(int last)
    {
    if (last= =max_q) p=1;
    else p=2;
    }

    Dek so‘zi (DEQ - Double Ended Queue) ingliz tilidan olingan bo‘lib 2 ta chetga ega navbat degan ma’noni bildiradi. Dek ustida bajariladigan amallar

    • Chapdan element kiritish.
    • O‘ngdan element kiritish.
    • Chapdan element chiqarish.
    • O‘ngdan element chiqarish.
    • Dek bo‘shligini tekshirish.
    • Dek to‘laligini tekshirish.

    Dekdagi asosiy amallar


    int kirit_right(int s){
    if(isFull()){cout<<"\n dek to'ldi";n=R;return EXIT_SUCCESS;}
    a[R]=s;R++;
    }
    bool isEmpty(){
    if(R==0) return true; else return false;
    }
    bool isFull(){
    if(R>=10) return true; else return false;
    }
    int olish_right(){
    if(isEmpty()){cout<< "\n dek bo'sh";return EXIT_SUCCESS;}
    R--;
    return a[R];
    }

    Download 0.52 Mb.
    1   2   3   4   5




    Download 0.52 Mb.

    Bosh sahifa
    Aloqalar

        Bosh sahifa



    8-Mavzu: Stek va navbatlar To‘plam

    Download 0.52 Mb.