Stack Exchange
log in
chat
meta
about
Stack Exchange
All Sites
Hot Questions
Top Users
Newsletters
Blogs
adamax
top
accounts
reputation
activity
favorites
subscriptions
Top Questions
17
votes
Improving treap implementation
performance
optimization
data-structures
haskell
garbage-collection
asked Jan 7 '11 at 15:07
stackoverflow.com
7
votes
Efficient number reading in Haskell
performance
parsing
haskell
asked Dec 20 '10 at 12:15
stackoverflow.com
Top Answers
38
Implement a queue in which push_rear(), pop_front() and get_min() are all constant time operations
stackoverflow.com
15
haskell foldl with (++)
stackoverflow.com
11
Java: multiple ++-increases in one line. Which one first?
stackoverflow.com
9
sorting int array with only 3 elements
stackoverflow.com
9
If f(n) = O(g(n)) , then is exp(f(n)) = O(exp(g(n)))
stackoverflow.com
7
How does “(1..4).inject(&:+)” work in Ruby
stackoverflow.com
6
Big O notation and algorithms
stackoverflow.com
6
How are Dynamic Programming algorithms implemented in idiomatic Haskell?
stackoverflow.com
6
Composing concat and map to get concatMap: why the f?
stackoverflow.com
5
How to change customer to different membership? Java
stackoverflow.com
5
Efficient Way to Find Pair Orderings?
stackoverflow.com
5
Interesting min price problem
stackoverflow.com
5
Succinct way in Ruby to manipulate this string
stackoverflow.com
Stack Exchange works best with JavaScript enabled