comp.lang.ada
 help / color / mirror / Atom feed
From: Wilson <leon.winslow@notes.udayton.edu>
To: stefan-lucks@see-the.signature
Subject: Re: Inefficient algorithms
Date: Sat, 11 Sep 2010 21:04:29 -0400
Date: 2010-09-11T21:04:29-04:00	[thread overview]
Message-ID: <op.viwalrbpanduac@home-2l5xxxt7p3> (raw)
In-Reply-To: Pine.LNX.4.64.1009111612280.19046@medsec1.medien.uni-weimar.de

I'm not sure if this is what you are looking for or not.  How about  
printing out all permutations of the first n integers?  The algorithm is  
in many texts along with an explanation.  See, for example:
http://en.wikipedia.org/wiki/Permutation


I'm also don't know which 2**n algorithm is simplest to write or  
understand, but there are literally thousands of problems that meet this  
criteria.  By the way, none of these problems are strictly speaking  
"inefficient".  Instead, they are just "computationally tedious"(My  
term)!  (I am taking inefficient to mean that a faster algorithm exits.)

In many of these problems (such as printing all the permutations) a faster  
algorithm is impossible. On the other hand, NP-Complete problems such as  
the binary problem discussed in some of the other posts have no known  
faster solution; i.e., a faster solution might exist, but we have no proof.

Good luck which ever way you choose to go.



--- news://freenews.netfront.net/ - complaints: news@netfront.net ---



  reply	other threads:[~2010-09-12  1:04 UTC|newest]

Thread overview: 23+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2010-09-11  4:24 Inefficient algorithms Rick
2010-09-11  6:51 ` J-P. Rosen
2010-09-13  3:45   ` Robert A Duff
2010-09-11  6:54 ` Niklas Holsti
2010-09-11  7:07   ` Niklas Holsti
2010-09-11  9:07     ` Rick
2010-09-11 15:05       ` Niklas Holsti
2010-09-17  5:26         ` Rick
2010-09-11  9:20     ` Ludovic Brenta
2010-09-11  9:23       ` Ludovic Brenta
2010-09-11 11:20       ` Niklas Holsti
2010-09-11 18:29         ` Peter C. Chapin
2010-09-11 14:28 ` stefan-lucks
2010-09-12  1:04   ` Wilson [this message]
2010-09-12  1:53   ` Rick
2010-09-12  8:35     ` Georg Bauhaus
2010-09-12 11:56     ` stefan-lucks
2010-09-15  1:11 ` BrianG
  -- strict thread matches above, loose matches on Subject: below --
2010-09-15  8:51 Rick
2010-09-15 21:45 ` John B. Matthews
2010-09-16 12:05   ` Chad  R. Meiners
2010-09-16 20:19     ` John B. Matthews
2010-09-17  5:24   ` Rick
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox