Re: [Haskell-cafe] Can Haskell outperform C++?

From: "Richard O'Keefe" Subject: Re: [Haskell-cafe] Can Haskell outperform C++? To: Haskell Cafe Message-ID: <5F6605A2-DFE0-4AEA-9987-3B07DEF34C42@cs.otago.ac.nz> Content-Type: text/plain; charset=us-ascii

On 17/05/2012, at 2:04 PM, Gregg Lebovitz wrote:

...

Richard,

Thank you. This is an example of what I had in mind when I talked about changing the playing field. Do you have a slide deck for this lecture that you would be willing to share with me? I am very interested in learning more.

No slide deck required.  The task is "generating alternating permutations".

Method 1: generate permutations using a backtracking search;          when a permutation is generated, check if it is alternating.

Method 2: use the same backtracking search, but only allow extensions          that preserve the property of being an alternating permutation.

Gregg, what makes Method 2 so much harder than Method 1 to implement in C or C++? Regards, RW