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 the 2 articles in this topic
Showing 2 of 176 articles.
Currently 10 other people reading this forum.


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

Login to reply

👍?
helpful
2:30pm Tue 28th May, ANONYMOUS

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


SVG not supported

Login to reply

👍?
helpful
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.

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  8:08AM Aug 25 2024
Privacy policy