I would like to do the following: public class ImmutableList<T> { public <U super T> ImmutableList<U> add(U element) { ... } } That is, given an immutable list of T, you can a...

It's well-known that the worst-case runtime for heapsort is Ω(n lg n), but I'm having trouble seeing why this is. In particular, the first step of heapsort (making a max-heap) takes time &The...

In effective STL by Scott Meyers (page 195) there is the following line: "The result of lower_bound must be tested to see if it's pointing to the value you're looking for. Unlike find, you can't j...

I wrote a simple program that sorts in O(n). It is highly memory inefficient, but that's not the point. It uses the principle behind a HashMap for sorting: public class NLogNBreak { public stati...

There are many optimization problems that are known to be NP-hard, such as the traveling salesman problem, MAX-SAT, or finding the minimum chromatic number of a graph. Given a problem of this sort,...