I think a plain old binary tree should do fine with this.
Since you have a limited number of elements, asymptotic performance is not as important as you think. Fast enough will stay fast enough if the data size can't grow.
After Compline,
Zaxo
In reply to Re: Advanced Data Structure Question
by Zaxo
in thread Advanced Data Structure Question
by Limbic~Region
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |