Stress-testing Control Structures for Dynamic Dispatch in Java

Created on 2020-08-19T21:16:04.492451

Return to the Index

This card pertains to a resource available on the internet.

This card can also be read via Gemini.

Binary tree dispatch is implied to be faster, though likely only as long as you do not have too many targets to choose from. The code grows logarithmically for each destination it has to select.