query: List comprehension with expensive computation
positive_passages.docid: 143188
positive_passages.text: How do I efficiently filter computed values within a Python list comprehension?
negative_passages.docid: 124901
negative_passages.text: Big-O notation and polynomials
negative_passages.docid: 128233
negative_passages.text: How Big can a Python List Get?
negative_passages.docid: 64680
negative_passages.text: Computational complexity of Fibonacci Sequence
negative_passages.docid: 67144
negative_passages.text: Is list::size() really O(n)?
negative_passages.docid: 59530
negative_passages.text: Efficiently finding the intersection of a variable number of sets of strings
negative_passages.docid: 118240
negative_passages.text: Is it Pythonic to use list comprehensions for just side effects?
negative_passages.docid: 116266
negative_passages.text: Most Efficient way to calculate Frequency of values in a Python list?
negative_passages.docid: 42724
negative_passages.text: Time complexity of memory allocation
negative_passages.docid: 50864
negative_passages.text: List comprehension vs map
negative_passages.docid: 121365
negative_passages.text: Why results of map() and list comprehension are different?
negative_passages.docid: 40226
negative_passages.text: Python: Is the split function evaluated multiple times in a list comprehension?
negative_passages.docid: 153963
negative_passages.text: Big O of Recursive Methods
negative_passages.docid: 97314
negative_passages.text: Counting nearly-sorted permutations
negative_passages.docid: 86983
negative_passages.text: ListPlot: Plotting large data fast
negative_passages.docid: 135408
negative_passages.text: Solving permutation problem sequentially.
negative_passages.docid: 103471
negative_passages.text: Efficient list intersection algorithm