Stack

Stack ("sṳ-tak-khoh") ia̍h tui-tia̍p (Hàn-jī: 堆疊), sī chi̍t khoán chu-liāu kò͘-chō, kî-tiong hông sóa cháu ê chi̍t hāng goân-kiāⁿ sī siāng bóe chhah-ji̍p ê hit hāng, iā chiō sī siāng-bóe ji̍p--lâi-ê tāi-seng sóa--chhut-khì.

Chhah-ji̍p (insert) ê chhau-chok, tī sṳ-tak-khoh it-poaⁿ sī kiò chò push ("sak"); thâi-tiāu (delete) ê chhau-chok hō chò pop.

Nā tùi khang ê sṳ-tak-khoh chò pop chhau-chok ê sî, su̍t-gú kóng hit-ê sṳ-tak-khoh tng underflow, chèng-siông lâi kóng sī chò chhò-gō͘ (error) chhù-lí. Nā sī sṳ-tak-khoh ê hāng-bo̍k sò͘-liōng chhiau-kòe tēng hó ê chè-hān, tio̍h kóng hit-ê sṳ-tak-khoh í-keng overflow.

Chham-khó

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest & Clifford Stein (2009). Introduction to Algorithms (Tē-3 pán.). The MIT Press. pp. 232–235. ISBN 9780262259460.

Siong-koan

Queue
Heap

Pún bûn-chiuⁿ sī chi̍t phiⁿ phí-á-kiáⁿ. Lí thang tàu khok-chhiong lâi pang-chō͘ Wikipedia.