Check out: http://www.freewebs.com/dcrooks/projects.html. Its a sudoku
solving program I created that uses Donald Knuth's dancing links algo.
You can read my code while trying to understand Donald Knuth's paper.
His paper can be found at:
http://xxx.lanl.gov/PS_cache/cs/pdf/0011/0011047.pdf
Trying to get a computer program to tune itself beyond what a
knowledgeable (in the subject), programmer can achieve, is dificult.
Of course, you'll have to learn and experiment somewhat to tune your
program.
There must be some biometric programming info available in papers and
such. Any luck
#includestdio.h
struct key {
int min;
double sum;
};
int main(int argc,char **argv)
{
int n,i,j,k;
int start=0,end=0;
double currentValue=0,eValue=0;
struct key opt[10];
int a[10];
while ( scanf(%d,n) != EOF )
{
When you have a nice algorithm from Googmeister in O(n log n) why try something else...?
On 7/5/06, mg [EMAIL PROTECTED] wrote:
#includestdio.hstruct key {int min;doublesum;};
int main(int argc,char **argv){int n,i,j,k;int start=0,end=0;double currentValue=0,eValue=0;struct key
Hello, anyone who is interested,
Does anyone here know well about the implementation for regular
expression and
pattern matching? I mean, are there such officially recognized good
design
and implementation? Or, at least, the de facto ones? Let me first
clarify a
few known facts:
* finite state
