Skip to content
#

binary-search

Here are 19 public repositories matching this topic...

A weighted random item sampler (selector), where the probability of selecting an item is proportional to its weight, and every item is sampled exactly once (without repetition or replacement). The sampling method utilizes a binary-search optimization, making it suitable for performance-demanding applications where the set of items is large.

  • Updated Oct 26, 2024
  • TypeScript

A weighted random item sampler (selector), where the probability of selecting an item is proportional to its weight. The sampling method utilizes a binary search optimization, making it suitable for performance-demanding applications where the set of items is large and the sampling frequency is high.

  • Updated Oct 26, 2024
  • TypeScript

Improve this page

Add a description, image, and links to the binary-search topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the binary-search topic, visit your repo's landing page and select "manage topics."

Learn more