Measure/estimate complexity (time and memory)

[niknetniko]

TESTed could do complexity (time and memory) measures (per context).

Extracted from #40.

[DieterPi]

Being able to set a specific time complexity would be awesome!

Would it be something like:

For a list of size n make a function (with a specific purpose) that finishes its task in time complexity less then n²?

[niknetniko]

Would it be something like:

For a list of size n make a function (with a specific purpose) that finishes its task in time complexity less then n²?

In a first instance, TESTed will probably estimate the time and/or memory complexity for submissions (and report this result), as we already experimented with this in the past.

Actually setting the required time and/or memory complexity is much more difficult, as you need some degree of certainty that our estimation is correct (which is a difficult thing to do).

(Note that this is a long-term research goal, so this won't be available any time soon.)

In the mean time, the best solution is to set a stricter time limit for the exercise.