coretan si cuplis

Contoh Circular Queue

ciri2 circular queue :

1. kosong : counter = 0
2. penuh : counter = n
3. bisa diisi : counter < n
4. ada isinya : counter > 0

kondisi awal :

f = 0;
r = -1;
counter = 0;

algoritma dasar circular queue :

1. INSERT

      R = (R+1) % n;
      Q[R] = X;
      Counter++;

2. DELETE

      X = Q[F];
      F =(F+1) % n;
      Counter--;

algoritma lengkap circular queue :

1. INSERT

   void INSERT(void){
       if(Counter < n){
           R = (R+1) % n;
           Q[R] = X;
           Counter++;
       }else{
           printf("antrian penuh");
       }
   }

2. DELETE

   void DELETE(void){
       if(Counter > 0){
           X = Q[F];
           F = (F+1) % n;
           Counter--;
      }else{
           printf("antrian kosong");
      }
   }

Related posts:

1. single stack
2. double stack
3. dml (data manipulation language) dalam sql