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

UWA week 23 (1st semester, 1st exam week) ↓

Exam Time Complexity Reasoning (both)

3:05pm Mon 3rd Jun, Amitava D.

ANONYMOUS wrote:

> Hi, > > I was just wondering for exam questions that require us to explain the time complexity, should we explain just how the dominant term is reached or the time complexity for the entire algorithm? > > For example, if an algorithm takes an overall time of 'n + n^2', can we just explain why the algorithm is O(n^2) or do we have to describe all parts of the algorithm including the 'n' time? > > > > Apologies if that doesn't make sense or has been answered elsewhere. Any help would be much appreciated. > > > Thanks.

You should analyse the time complexities of all parts of an algorithm. The analysis of non-dominant parts will cost you (may be) two more sentences and half a minute of writing.

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