Binary Tree Dispatch

Created on 2020-08-19T22:00:57.384695

Return to the Index

This card can also be read via Gemini.

Binary tree dispatch uses "binary search" to find where a message should be sent.

There are O(log(n)) tests involved and there are only simple comparison operators involved; so this is cheaper than ex. having to find buckets in a hash table and compare keys. But only to a point.