This does not seem like a good question for auditing purposes: Algorithm : Letters and envelopes pairing

It does not appear to be about programming, it appears to be "what's your favorite greedy algorithm", and would probably be a better fit for a math/puzzles site.

Forgive me if I am missing something really obvious.


Just because a question might be on-topic elsewhere doesn't mean it's off-topic here.

In this case, the author has already identified an algorithm that works, but he's looking for something more efficient. Not "favorite", mind you - faster.

The relevant discussions here would probably be:

For what it's worth, 9 people have been audited with this question; only 3 failed that audit, including yourself.

| improve this answer | |
  • hmm... isn't 33% failure rate kinda... high? (I still agree the question should stay open) – John Dvorak Feb 1 '14 at 5:43
  • Here's a similar question that's up for closure. Its also asking for a "fastest algorithm". I voted to leave it open based on the feedback given here. It might make another good audit question. stackoverflow.com/questions/21565721/…. – user173448 Feb 5 '14 at 2:49
  • That one's not a particularly good audit because it's not a particularly good question otherwise, @noloader. He doesn't describe the specifics of what he's doing very well, or where he's looking to improve performance. – Shog9 Feb 5 '14 at 2:53

You must log in to answer this question.