circular queue
ciri2 circular queue :
- kosong : counter = 0
- penuh : counter = n
- bisa diisi : counter < n
- ada isinya : counter > 0
kondisi awal :
f = 0; r = -1; counter = 0;
algoritma dasar circular queue :
- INSERT
R = (R+1) % n; Q[R] = X; Counter++;
- DELETE
X = Q[F]; F =(F+1) % n; Counter--;
algoritma lengkap circular queue :
- INSERT
void INSERT(void){ if(Counter < n){ R = (R+1) % n; Q[R] = X; Counter++; }else{ printf("antrian penuh"); } }
- DELETE
void DELETE(void){ if(Counter > 0){ X = Q[F]; F = (F+1) % n; Counter--; }else{ printf("antrian kosong"); } }
Related posts:
- double ended queue ciri2 double ended queue : kosong : L = R...
- single stack ciri2 single stack : kosong : top = -1 penuh...
- double stack ciri2 double stack : stack 1 kosong : top1 =...
- linked list hitung jumlah simpul : Q = FIRST; Jum = 1;...
- dml (data manipulation language) dalam sql Data Manipulation Language (DML) SELECT Menampilkan sebagian atau seluruh isi...
Related posts brought to you by Yet Another Related Posts Plugin.
You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.


