Weighted random sample in python
I’m looking for a reasonable definition of a function weighted_sample that does not return just one random index for a list of given weights (which would be something like
algorithm
Merging a list of time-range tuples that have overlapping time-ranges
I have a list of tuples where each tuple is a (start-time, end-time). I am trying to merge all overlapping time ranges and return a list of distinct time ranges.
For example
General bars and stars
I’ve got a the following “bars and stars” algorithm, implemented in Python, which prints out all decomposition of a sum into 3 bins, for sums going from 0 to 5.
I’d like to generalise my code so it works with N bins (where N less than the max sum i.e 5 here).
The pattern is if you have 3 bins you need 2 nested loops, if you have N bins you need N-1 nested loops.
Find elements of array one nearest to elements of array two
This answer explains how to find the nearest (sorted) array element to a single point, in a manner efficient for large arrays (slightly modified):
How to test if one string is a subsequence of another?
A subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements
Python program to check matching of simple parentheses
I came across this exercise of checking whether or not the simple brackets “(“, “)” in a given string are matched evenly.
Python Implementations of Packing Algorithm
For an application I’m working on I need something like a packing algorithm implemented in Python see here for more details. The basic idea is that I have n objects of varying sizes that I need to fit into n bins, where the number of bins is limited and the size of both objects and bins is fixed. The objects / bins can be either 1d or 2d, interested in seeing both. (I think 3d objects is probably more than I need.)
Where can I find source or algorithm of Python’s hash() function?
>>> hash("x01") 128000384 >>> hash("x02") 256000771 >>> hash("x03") 384001154 >>> hash("x04") 512001541 Interesting part is 128000384 x 2 is not 256000771, and also others I am just wondering how that algorithm works and want to learn something on it. Answers: Thank you for visiting the Q&A section on Magenaut. Please note that all the answers … Read more
Python Integer Partitioning with given k partitions
I’m trying to find or develop Integer Partitioning code for Python.
Python Weighted Random
I need to return different values based on a weighted round-robin such that 1 in 20 gets A, 1 in 20 gets B, and the rest go to C. So: A => 5% B => 5% C => 90% Here’s a basic version that appears to work: import random x = random.randint(1, 100) if x … Read more