Adak

Socbar, where did you find this problem? It has a real simple side to it, but takes a real turn for the deep end of the pool, quite soon. Good one!

Harakim

I think that a minimum-spanning tree might be useful. It is easier than Djikstra's algorithm, but would help cut out all of the unnecessary steps. However, you would have to put together some peices at the end.

gelareh_m

hi i'm gelareh i have a question of data structure & algorithms in "c" these are my questions i wanted to know their algorithm and to write them:
Problem 1:
The program of Horner’s low :

Horner’s law :




That has the least number of multiplies .

Problem 2:
The problem of “Pigeon Hole “that implies if function F has n
inputs & less than n outputs then we have two inputs like a , b
that a ≠ b , F(a)=F(b)


Problem 3:
The perm algorithm “ recursion form” that is written in the
book but it is a little hard for me to understand .

pegasus001

Do you know how to program??????

__________________
You never test the depth of a river with both feet.
The believer is happy. The doubter is wise.
Free speech carries with it some freedom to listen.
The next generation will always surpass the previous one. It`s one of the never ending cycles of life.

DaWei

Gelarah, please stop hijacking threads. Pick an appropriate forum and ask your questions. Read the "How to Post a Question" thread, at the top of this forum, first.

__________________
Abstraction doesn't make it impossible to write bad code; it makes it possible to write superior code.
Contributor's Corner: Grumpy on C++ Exceptions DaWei on Pointers

pegasus001

I was just going to edit my post to tell the same. Unlucky me.

__________________
You never test the depth of a river with both feet.
The believer is happy. The doubter is wise.
Free speech carries with it some freedom to listen.
The next generation will always surpass the previous one. It`s one of the never ending cycles of life.

Fall Back Son

Crap! I forgot about this one for a good bit. Anyway, the one question I wanted to ask about this, if you're still around:

do you want to write a program that will eliminate "repeated" steps... or do you want a program that will take into account the shortest possible way to accomplish all of the turtle's movements, then return the appropriate answer? The two are slightly different, in some cases, I think.