help2200

It's UWAweek 42 (2nd semester, week 12)

help2200

This forum is provided to promote discussion amongst students enrolled in CITS2200 Data Structures and Algorithms.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!" followup message.

How do I ask a good question?

Displaying selected article

Showing 1 of 176 articles.
Currently 4 other people reading this forum.

UWA week 22 (1st semester, study break) ↓

Kruskal Union Time Complexity (all 6)

4:06pm Thu 30th May, Amitava D.

"Hugo Smith" <23*2*1*2@s*u*e*t*u*a*e*u*a*> wrote:

> I also have a question which links onto this one, if we are explaining the time complexity of Kruskal's, do we talk about the inverse Ackermann function?

No, we did not do any such complicated thing. I have explained the complexity in a very simple way. When we do the union operation, we double at least one of the sets by the union. Since it is true in every step, we need O(log n) steps. Please listen to the lecture on Kruskal's algorithm.

help2200 articles all ANNOUNCEMENTS recent articles login to post a new article help2200 topics from today and yesterday from the past week from the past two weeks ALL topics, most recent first	login chapter0 unitinfo research projects csforum csse-feedback csbreakdown cssubmit csmarks 2nd semester help fora Algebra Advanced Algorithms Cloud Computing High Performance Computing Intelligent Agents Professional Computing Relational Database Management Systems Systems Programming