Docs grader¶

This grader checks for the asymptotic estimates of worst case performances and the rationales from the file datastructures.hh.

Here is an example for a valid asymptotic notation and the rationale for that asymptotic notation:

// Estimate of performance: O(n * log(n))
// Short rationale for estimate: function call y is
// logarithmic and it is called n times
void function();

The asymptotic performance should be on the same comment line with the text "Estimate of performance:" and is recognized by an automatic tester, so it must be in a form that a program can understand

For this there is a test box above the submission box, if it is recognized by the program and outputs a string that matches the asymptotic notation you gave, it is ok to use

Here are a few examples:

O(n * log(n))
O(nlogn)

O(n^2)
O(n^(2))

O(n^(2)logn)
O(n^2logn)

It is important to note that these are just examples, if you want to check if your notation is recognized, please use the tester below

Submitting Your Project to Plussa