Boost logo

Boost :

Subject: Re: [boost] combinations and permutations
From: Howard Hinnant (howard.hinnant_at_[hidden])
Date: 2011-01-04 13:56:01


On Jan 4, 2011, at 12:00 PM, Thorsten Ottosen wrote:

> Den 04-01-2011 04:40, Howard Hinnant skrev:
>> Warming this up for tr2:
>>
>> http://home.roadrunner.com/~hinnant/combinations.html
>>
>> Comments welcome. Real world use welcome.
>
> Very useful. I have been using Hervé Brönnimann's extensions for years in my own work (intended for TR2 IIRC). I attach his work.

I agree that Hervé did an excellent job with his algorithms.

I'm curious: Which algorithms of his do you use? And for what ballpark ranges of r (distance[first, middle)) and N (distance(first, last))?

-Howard


Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk