Quote:Original post by ToohrVyk

Quote:Original post by doctorsixstring
I doubt the Python code is any faster, but I think it is significantly easier to read and understand (no offense to pascalosti or ToohrVyk ).

I certaintly won't disagree with that! C++ is often a very bad idea for small-to-medium problems such as this one, and sometimes a bad idea for larger problems as well.

While we're at it:

*** Source Snippet Removed ***

Quote:Original post by TheUnbeliever
Out of curiosity, what language is that? I don't recognise it at all. It looks like a functional language, at a guess...

// in generate_borders()if (x == 0 || x == Width - 1 || y == 0 || y == Width - 1)// should beif (x == 0 || x == Width - 1 || y == 0 || y == Height - 1)// in compute_path()for(;;)// should imho be (for clarity)while(true)// or preferably (perhaps with some checks after the loop)while( !candidates.empy() ) // to avoid calling candidates.top(); when candidates is empty// in compute_path()if (next = pos(Width-2,Height-2)) break;//should probably beif (next == pos(Width-2,Height-2)) break;

for(;;){  assert (!candidates.empty());  // .. code}