順回表現queue, dequeの入出力アルゴリズムについて
スポンサーリンク
概要
- 論文の詳細を見る
This note presents the "effective" algorithms for the intersion and the deletion into/from the circular queue and the circular deque. According to the old algorithms,M-1 items Can be in queue (or the deque) of M cells at one time with out overflow. But according to our algorithms to be presented, M items can be in the queue (or the deque) of M cells at one time without overflow. In these algorithms, the extra variables, except F,R which are respectively a front and a rear variables, are not used.
- 一般社団法人情報処理学会の論文
- 1977-12-15