Question 4: 23-4

10 views

Skip to first unread message

Matt Peterson

unread,

Nov 12, 2012, 6:03:06 PM11/12/12

to cs56...@googlegroups.com

I am not understanding what this part of the question is looking for:

"Describe the most efficient implementation of each algorithm."

I can tell which ones work and which ones don't, but I do not know how to answer this part.

--
-Matt Peterson

Jared Saia

unread,

Nov 13, 2012, 2:18:23 PM11/13/12

to cs561-f12

Matt,

It's asking you to determine how to most efficiently fill in the details of the pseudocode.

For example, Algorithm A tests if T-{e} is a connected graph repeatedly. How can you do this most efficiently.