Priority queue: Difference between revisions
Content added Content deleted
(Added uBasic/4tH version) |
|||
Line 6,899: | Line 6,899: | ||
=={{header|uBasic/4tH}}== |
=={{header|uBasic/4tH}}== |
||
This implementation inserts items using a binary search. Hence, no |
This implementation inserts items using a binary search. Hence, no 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 |
<lang>b = -1 ' b points to last entry on the queue |
||
Line 6,984: | Line 6,984: | ||
0 OK, 0:750 |
0 OK, 0:750 |
||
</pre> |
</pre> |
||
=={{header|VBA}}== |
=={{header|VBA}}== |
||
<lang VB>Type Tuple |
<lang VB>Type Tuple |