query: What is the time complexity of the following function?
positive_passages.docid: 21361
positive_passages.text: c++ practical computational complexity of  SQRT()
negative_passages.docid: 110142
negative_passages.text: 1-1 Function Composition
negative_passages.docid: 8645
negative_passages.text: A formula for bit strings with no $k$ consecutive $1$'s using generating functions
negative_passages.docid: 155831
negative_passages.text: What are the total number of ordered permutations of a list of elements (possibly repeated)?
negative_passages.docid: 26569
negative_passages.text: Counting binary operations on a set with $n$ elements
negative_passages.docid: 114355
negative_passages.text: Speeding up the built-in Rudin-Shapiro and Thue-Morse sequence functions
negative_passages.docid: 52324
negative_passages.text: Tight bound for $T(n) = T(n^{1/2}) + 1$
negative_passages.docid: 23526
negative_passages.text: Complexity of arithmetic in a finite field?
negative_passages.docid: 151316
negative_passages.text: Is PHP's count() function O(1) or O(n) for arrays?
negative_passages.docid: 113342
negative_passages.text: Confusion of the decidability of $(N,s)$
negative_passages.docid: 55485
negative_passages.text: Recursive Function - $f(n)=f(an)+f(bn)+n$
negative_passages.docid: 94703
negative_passages.text: Time complexity and optimality
negative_passages.docid: 77180
negative_passages.text: In pure functional languages, is there an algorithm to get the inverse function?
negative_passages.docid: 60747
negative_passages.text: Recurrence relation using substitution method
negative_passages.docid: 138072
negative_passages.text: Linear time algorithm for 2-SUM
negative_passages.docid: 144890
negative_passages.text: Recurrence $f_{n+2}=af_{n+1}+bf_n$
negative_passages.docid: 107595
negative_passages.text: Iteratively minimizing the function