Investigate SortedQueue performance and implementation

[clorton]

Latest runs in FUSION take ~245 seconds (4:05) total of which ~100 seconds (1:40) are spent in do_non_disease_deaths (measured on my machine).

1. is this a reasonable amount of time (consider number of operations and number of memory accesses)
2. is there a better overall implementation (also consider compiled code)
3. could it just be more efficient when popping items (i.e., bubble subsequent items up) and pushing items (assume new items will be toward the back, so append and bubble up)