query: Finding minimum value in a stack with O(1) time complexity
positive_passages.docid: 155761
positive_passages.text: Retrieving the Min element in a stack in O(1) Time
negative_passages.docid: 148260
negative_passages.text: Polylogarithms of negative integer order
negative_passages.docid: 104176
negative_passages.text: $15x\equiv 20 \pmod{88}$ Euclid's algorithm
negative_passages.docid: 137301
negative_passages.text: To find the minimum of $\int_0^1 (f''(x))^2dx$
negative_passages.docid: 107595
negative_passages.text: Iteratively minimizing the function
negative_passages.docid: 40635
negative_passages.text: Finding Maximum value of consecutive positive integers with constraints
negative_passages.docid: 128147
negative_passages.text: Time Complexity of Ternary Search Algorithm
negative_passages.docid: 94023
negative_passages.text: Time Complexity for Java ArrayList
negative_passages.docid: 148734
negative_passages.text: Time complexity analysis. choosing operator for counting number of times a line of code runs
negative_passages.docid: 42724
negative_passages.text: Time complexity of memory allocation
negative_passages.docid: 127634
negative_passages.text: query on maximum minimum of multi-variable function
negative_passages.docid: 138072
negative_passages.text: Linear time algorithm for 2-SUM
negative_passages.docid: 142904
negative_passages.text: finding the running time for my algorithm for finding whether an input is prime in terms of the input
negative_passages.docid: 126259
negative_passages.text: Minimum of a function on an open interval
negative_passages.docid: 140044
negative_passages.text: A set union find algorithm
negative_passages.docid: 56808
negative_passages.text: Getting the lowest and highest value from integers without using arrays?
negative_passages.docid: 152333
negative_passages.text: A problem based on pigeonhole