Re: Finding algorithms

From: Nils Petter Vaskinn (no_at_spam.for.me.invalid)
Date: 07/31/03 

Date: Thu, 31 Jul 2003 09:05:49 GMT

On Thu, 31 Jul 2003 04:08:48 +0000, Greg P. wrote:

> "Christopher Wong" <cwong@world.std.com> wrote in message
> news:bga4hs$ijc$1@bob.news.rcn.net...
>> What would make a good resource for algorithms? There are ample
>> references APIs, languages, structure and numerical work. But some
>> applications need
> a
>> little more thinking. For example: a program that sets up matches for a
>> competition, maximizing matchups, randomness and competitiveness.
>> That's a combinatorics and optimization problem. Where would you go to
>> when you want to solve a practical problem rather than spend the next
>> few weeks working through theory?

Do you need perfect or good?
First shot at an algorithm:
1. assign randomly
2. Do a few checks to identify if the alternative sucks
3. If it does suck goto 1
4. done

Then depending on how badly it performs improve the placing in step 1
until performance is acceptable.

The thing is it depends on how much the program is used, if it's used for
one specific competition once a year it's ok if it takes 10 minutes to
find a good setup, compared to an unknown amount of programmer time. If
it's to be used a lot it may be time to get out those combinatorics books.

> A whiteboard, black marker, cold coffee, and a cigarette =)

Cold coffee? ouch! I'd have to be pretty desperate to resort to that.

Whiteboard, several colors markers, paper, pen, hot coffee (but not hot
enough to burn your tounge), cigarettes.

regards
NPV

Relevant Pages

  • Re: Finding algorithms
    ... >> What would make a good resource for algorithms? ... >> competition, maximizing matchups, randomness and competitiveness. ... compared to an unknown amount of programmer time. ... Cold coffee? ...
    (comp.os.linux.development.apps)
  • Re: I tell you which is the best textbook on algorithms in the world?
    ... algorithms in the world: ... Not "The Art of Computer Programming" written by K.E.Knuth, ... Furthermore, this isn't a competition. ...
    (comp.programming)
  • Re: Finding algorithms
    ... >> APIs, languages, structure and numerical work. ... >> competition, maximizing matchups, randomness and competitiveness. ... >> combinatorics and optimization problem. ... Have you read the Algorithms in by R. Sedgewick? ...
    (comp.unix.programmer)
  • Re: Finding algorithms
    ... >> APIs, languages, structure and numerical work. ... >> competition, maximizing matchups, randomness and competitiveness. ... >> combinatorics and optimization problem. ... Have you read the Algorithms in by R. Sedgewick? ...
    (comp.os.linux.development.apps)