Nvm, I was acutually thinking about Dijkstra s Algorithm not Kruskal s, been struggling getting to nlogn. The best achievable complexity with my given approach is ( ( ) log ), which is close but not strictly ( ...

I would also like to know what the first student asked Hey, looking back on lecture material, for kruskals algorithm the complexity is O((n m)log(n)), where n vertices and m edges. It states that all the MST union operations result in complexity...

In the lectures, have we covered the harmonic mean for calculating average speeds? Thank you.

Yeah its getting pretty close, surprised it wasn't uploaded on Friday.

Thank you so much Was pretty confused, guess its just how the question is written. Thank you for clarifying

For the first question. D is correct right? Since we are comparing Big O notation. Thought I'd just double check, thank you

I seem to fix one issue and another pops up, not really sure where to go anymore. I seem to always be getting these fails. Have I missed something with these calculations, if so let know if you can point me in a direction that might help solve these ...

Surprising that its week 2 and hardly anything is up, beside lectures.