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

No, the answer is A. "f(n) is O(g(n))" basically means the graph of f(n) will be bounded by the graph of g(n) at some point, and multiplied by some constant factor. And the notation is confusing because it's " ", but think of it as " " so O(n) O(...

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

Is it just me, or would none of the given answers work, as b d both have syntax errors, and the others don't capture the base case

I was having a similar issue, with errors from test submit run() when either RUNS 83, because then size 1. It was an AttributeError 'NoneType'. I had to correct the sorting algorithm to make sure that if len(runs) 1, it would return runs (as...

the unit tests dont check for enumerate. I also dont think enumerate counts as a sorting function.

The brief says we cannot use pythons in built functions for sorting does this include enumerate?

ANONYMOUS wrote Only materials from week 1-4

ANONYMOUS wrote Please submit answers.md and the python file, zipped together

my code is passing all tests until i change the size variable to under 90 in the testing program do you think that this could be why? because before when i tested i was having failures but no errors until size was lower then 10.now I'm unsure if i...

Hi, I have found an error in the testing code that may cause the code to crash on different seeds starting parameters. In test get rank time(), on line 103, the variable "size" is defined to be a random integer between 0 and SIZE inclusive. Later, on li...

yeah i'm having the same issue with mine. extremely confused as i've tried all logical variations, and tested with my own list of runs, but when it comes to the unit testing it fails. not able to make it to the lab today to get help unfortunately so ...

Will this test include material from week 4 (starting the 18th) i.e. Amortized complexity, introduction to recursive data structures. Or just everything before? Cheers

is your code passing because my code 100 does this but it is asking for a different order e,g Traceback (most recent call last) File "C Users takud OneDrive Desktop lab2 test speedrunning.py", line 99, in test submit run self.assertEqual(recei...

If the slower run is removed, then they wouldn't be submitting multiple runs.

I've talked to a couple of lab facilitators on this matter, one said just have the python file and answers file as separate files zipped together and another said to be safe put your answers in both and submit a zip with both. I'm more inclined to be ...

the output expected of get runs is a list of tuples in form (time, name), ranks are good I use them myself in a class for the entries but you need to convert them back into the (time, name) form for get runs.

You're overcomplicating it, it's just whichever is less in Name1 Name2 form comes first, which follows the encoding values where capitals come before lowercase letters. Apple apple, Bpple apple, and apple bpple as well ass Apple Bpple.

Hi, I have a question regarding the submit run function of Lab 2. So it says that runners can submit multiple runs. I just wanted to confirm that suppose, one individual submits 2 running times. Do we keep both submissions in the leaderboard, or are ...

In the lab it is specified when two runs have the same time that they should be 'tie-broken by runner name.' I'm having trouble with this, originally i thought it meant in Lexicographical order but my code keeps failing particularly when runs have ...