https://news.ycombinator.com/item?id=17745779 (2 months ago)
Have you tried pyflakes?
There you go, quick and dirty. http://paste.awesom.eu/MtSW https://imgur.com/a/YpPqy
« URL's must start with "http://" » « https://medium.com/@darrenrovell/all-journalists-need-to-be-... »
http://3.bp.blogspot.com/-MjXNThXAz_A/T29VMoFcBKI/AAAAAAAAAP... Why is that the picture for J?
I was referring to the print s*n example (O(n) being exponential wrt the size of the input). You're welcome ;)
Says it studies the complexity wrt the size of the input but doesn't say the size of n is O(log n) when it comes to the example :(
https://news.ycombinator.com/item?id=17745779 (2 months ago)
Have you tried pyflakes?
There you go, quick and dirty. http://paste.awesom.eu/MtSW https://imgur.com/a/YpPqy
« URL's must start with "http://" » « https://medium.com/@darrenrovell/all-journalists-need-to-be-... »
http://3.bp.blogspot.com/-MjXNThXAz_A/T29VMoFcBKI/AAAAAAAAAP... Why is that the picture for J?
I was referring to the print s*n example (O(n) being exponential wrt the size of the input). You're welcome ;)
Says it studies the complexity wrt the size of the input but doesn't say the size of n is O(log n) when it comes to the example :(