Revision as of 12:40, 7 July 2022 (view source) Hansoft (talk \| contribs) (Added uBasic/4tH version) ← Older edit		Revision as of 13:02, 7 July 2022 (view source) Hansoft (talk \| contribs) m (→‎{{header\|uBasic/4tH}}) Newer edit →
Line 6,899: =={{header\|uBasic/4tH}}== This implementation inserts items using a binary search. Hence, no ~~dequeuing~~sorting is required, since all entries are always in order of priority. It also allows for listing of valid entries. <lang>b = -1 ' b points to last entry on the queue Line 6,984: 0 OK, 0:750 </pre> =={{header\|VBA}}== <lang VB>Type Tuple

Priority queue: Difference between revisions

Priority queue (view source)