# Efficient SelectiveDo and binary search

**URL:** <https://discourse.haskell.org/t/efficient-selectivedo-and-binary-search/1657>\
**Category:** Uncategorized\
**Created:** [December 14, 2020, 11:03am UTC](https://discourse.haskell.org/t/efficient-selectivedo-and-binary-search/1657 "2020-12-14T11:03:21Z")\
**Posts on this page:** 1\
**Showing post:** 3

<div class="post-metadata">

**Author:** ![turion](https://sea2.discourse-cdn.com/flex002/user_avatar/discourse.haskell.org/turion/32/989_2.png) [@turion](https://discourse.haskell.org/u/turion)\
**Post date:** [December 14, 2020, 4:18pm UTC](https://discourse.haskell.org/t/efficient-selectivedo-and-binary-search/1657/3 "2020-12-14T16:18:35Z")

</div>

Yes, it’s a lot of work to write such a proposal in high quality, and a commitment to an implementation. But I would have expected that at least there would have been a blog post about this.

---

_[View the full topic](https://discourse.haskell.org/t/efficient-selectivedo-and-binary-search/1657)._