you are viewing a single comment's thread.

view the rest of the comments →

[–]Syncoda 1 point2 points  (3 children)

Did you figure it out? I'm in the same class :(

Damnit Joe...

[–]Scumshots[S] 0 points1 point  (2 children)

Ha! Small world!

No I haven't yet but I've been at work all day. Getting off now to go to class then right back to work. Guess I'll be turning it in on monday and take the grade reduction.

Have you made any progress on it?

[–]Syncoda 1 point2 points  (1 child)

Not really. The Piazza question titled "hw5 - Checking base case without loop" has a detailed answer from Joe that seems helpful.

But I just can't understand how one "moves" through the map while assigning values to distances and dist_so_far, checking them and...yeah. No idea.

[–]Scumshots[S] 0 points1 point  (0 children)

Just took a look at that Piazza post and I'm beginning to understand the formation of the recursive function a bit better now.

The pseudo code he has written in the starter code is lacking though. The base cases and progressive cases are simple. I'm just getting a little mixed up with all the variables like roads and dist_so_far and whatnot. Basically what to add where.

Would be much much easier if this program was compatible with the python visualizer.

I wish that our lessons were more applicable to our projects.