Fine-tune binary heap sifting logic

There's a fundamental compromise in sifting strategy that optimizes for small/big heaps or elements.

See #30534 for discussion and details, which changed `pop` to optimize for the large case. It's possible a branch on `self.len` could produce better results for small cases.

CC @bluss if you want to chime in
