Thanks Rashakil ...I actually handed in the assignment the morning after I posted that, I ended up going with option b) after all. hehe

And also, it's sort of strange to email your lecturer with...

Hi all

I am implementing the TSP problem in Java. Here is the question:



And here is the MST Preorder walk strategy:

For the Binary Tree Question, I know that the equation is true, from having tried examples of it.

e.g. from the following sketch, the sum would be: 1/8 + 1/8 + 1/4 + 1/2 = 1.
And the equality is...

Here is my answer to the first one.


a)
struct heap{
int maxsize; //maximum size of the heap
element[] table; //array containing elements of the heap
int last; ...

Hi all

Here are two questions from my Algorithms & Complexity Theory assignment.


1. A complete binary tree is a binary tree in which every level, except possibly the deepest, is completely...

ah ok... nevermind...

The square root itself is within error of the correct sqrt, not the sqrt^2 being within error of the correct square.

Don't mind me. :o

Thanks again for the help, guys.

'ellos

Thanks Rashakil.

I tried implementing it that way. We then had to compare the efficiency (number of iterations) of the BissectionSQRT method with that of another sqrt method. I tried...

Thanks for the reply indianscorpion.

So I'm thinking the BissecSQRT algorithm runs only once and looks sort of like this:



The problem I'm having is that, in a later question I will have to...

Hi all

Here is a question from my assignment in Algorithms & Complexity Theory. I'm having a problem with part 2.




My answer to part 1 is as follows: