Efficiency Viewer

A simple extension to help CS students develop an intuitive grasp on time complexity with their own algorithms.

Features

Shows the time complexity of a function in asymptotic notation.
Generally speaking, time complexity is a measure of time performance relative to input.
So this will only calculate performance with functions that take:

-An array as a first parameter
-An optional key/target (if it's a search function) as a second parameter


Known Issues

Infinite loops are known to cause infinite performance measurement

Release Notes

0.0.1

Initial release