OctoReasoner/CodeTimeComplexity

Code Time Complexity prediction

Sourced from BigOBench, using a subset of the N-most commonly occuring time complexities in the dataset

Three tasks:

• tc_direct: Directly predict the time complexity as O(X) given the code
• code_to_tc_mcq: Select the correct time complexity from four options, given the code
• code_from_tc_mcq: Given a time complexity, select the code with that time complexity from four options.

Complexity
O(1)
O(logn)
O(n)
O(n+m)
O(nlogn)
O(nlogn+m)
O(n+mlogm)
O(n*m)
O(n**2)