ÇѱÛÁ¦¸ñ(Korean Title) |
»ó¼ö »ðÀÔ ÀüÀÌ ½Ã°£À» °¡Áö´Â ¾ç´Ü ¿ì¼±¼øÀ§ Å¥ |
¿µ¹®Á¦¸ñ(English Title) |
A Double-Ended Priority Queue with O(1) Insertion Amortized Time |
ÀúÀÚ(Author) |
Á¤ÇØÀç
Haejae Jung
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 16-A NO. 03 PP. 0217 ~ 0222 (2009. 06) |
Çѱ۳»¿ë (Korean Abstract) |
¿ì¼±¼øÀ§ Å¥´Â ½ºÄÉÁÙ¸µ, Á¤·Ä, À¯ÀüÀÚ °Ë»ö°ú °°Àº ¿ì¼±¼øÀ§¿¡ µû¸¥ °Ë»ö, ÃִܰŸ® °è»ê°ú °°Àº ÀÀ¿ë¿¡ »ç¿ëµÉ ¼ö ÀÖ´Ù.
º» ³í¹®¿¡¼ Á¦¾ÈÇÏ´Â ¹è¿À» ÀÌ¿ëÇÑ ¾ç´Ü ¿ì¼±¼øÀ§ Å¥ ÀڷᱸÁ¶´Â »ðÀÔ°ú »èÁ¦ ¿¬»ê¿¡ °¢°¢ O(1) ÀüÀ̽ð£°ú O(logn) ½Ã°£ÀÌ °É¸°´Ù. º» ÀúÀÚ°¡ ¾Ë°í ÀÖ´Â ÇÑ, Áö±Ý±îÁöÀÇ ¹è¿À» ÀÌ¿ëÇÑ ¾ç´Ü¿ì¼±¼øÀ§ Å¥ ¾Ë°í¸®ÁòÀº »ðÀÔ°ú »èÁ¦¿¡ ¸ðµÎ O(logn) ½Ã°£ÀÌ °É¸°´Ù. |
¿µ¹®³»¿ë (English Abstract) |
Priority queues can be used in applications such as scheduling, sorting, retrival based on a priority like gene searching, shortest paths computation. This paper proposes a data structure using array representation for double-ended priority queue in which insertion and deletion takes O(1) amortized time and Ologn) time, respectively. To the author's knowledge, all the published array-based data structures for double ended priority queue support O(logn) time insertion and deletion operations. |
Å°¿öµå(Keyword) |
ÀÚ·á ±¸Á¶
¾ç´Ü ¿ì¼±¼øÀ§ Å¥
Èü
ÀüÀÌ ½Ã°£ º¹Àâµµ
Data Structure
Double-Ended Priority Queue
Heap
Amortized Time Complexity
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|