English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

what are the advantages of circular queue???

2006-09-21 16:33:04 · 2 answers · asked by babli_ps 2 in Computers & Internet Programming & Design

2 answers

finite memory and newest data is not lost (but oldest data is overwritten)

Edit:

I meant static memory, not finite.

2006-09-21 16:41:21 · answer #1 · answered by Anonymous · 0 0

Ouch, my ex-girlfriend couldn't get this idea too, but in an enqueue() and dequeue() operation such data structure takes O(1); this is speedy in comparison to other type of queue, recall your Big-Oh notation.

chino above describes the disadvantage of it.

2006-09-21 23:42:26 · answer #2 · answered by Andy T 7 · 0 0

fedest.com, questions and answers