At 12:21 +0200 on 10/03/2015, Bernd Oppolzer wrote about Re: Branch Table:
When you have really large branch tables with hundreds of functions, sequential table lookup will be a performance problem. Then you should consider binary search etc.
Binary search requires the table to be in alpha order of the function names. For a sequential search the entries can be in any order including in descending order of expected usage - ie: You put the routines you expect to call the most at the top of the table.
