query: Programmatically determine asymptotic runtime of a given algorithm?
positive_passages.docid: 800
positive_passages.text: Programmatically obtaining Big-O efficiency of code
negative_passages.docid: 149377
negative_passages.text: find length of sequences of identical values in a numpy array (run length encoding)
negative_passages.docid: 45560
negative_passages.text: Can all iterative algorithms be expressed recursively?
negative_passages.docid: 99307
negative_passages.text: How can I safely (and easily) count *all* instances of a class within my program?
negative_passages.docid: 40185
negative_passages.text: Graphing the amount of time a function takes
negative_passages.docid: 87450
negative_passages.text: Measuring code execution time
negative_passages.docid: 58406
negative_passages.text: How do I profile memory usage in Python?
negative_passages.docid: 35382
negative_passages.text: What is the fastest algorithm for finding the natural logarithm of a big number?
negative_passages.docid: 81393
negative_passages.text: Asymptotic complexity of .NET collection classes
negative_passages.docid: 323
negative_passages.text: How to determine Stack size of a Program in linux?
negative_passages.docid: 143783
negative_passages.text: What is the best way to get the count/length/size of an iterator?
negative_passages.docid: 9443
negative_passages.text: Is there a way to count the number of IL instructions executed?
negative_passages.docid: 45752
negative_passages.text: How do I get time of a Python program's execution?
negative_passages.docid: 40316
negative_passages.text: Beyond Stack Sampling: C++ Profilers
negative_passages.docid: 53370
negative_passages.text: Determine the size of a C++ array programmatically?
negative_passages.docid: 19707
negative_passages.text: time complexity or hidden cost of .length in java
negative_passages.docid: 124227
negative_passages.text: Finding command execution time in hindsight