help2200

It's UWAweek 47

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 16 other people reading this forum.

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

time-complexity question (both)

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

ANONYMOUS wrote:

> Hello, > > Q3 (b) of 2019 exam asks to show n(log(n))^2 = O(n^2). I do not know how to derive an upper-bound of n for the (log(n))^2 term. Please explain how I might derive this mathematically. Thank you

Please see the lecture/tutorial where I had worked out several such examples.

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