News for hackers. Stuff that matters.
Re:The Dollar Redesign Project by wooster on Wednesday May 20, 2009 @06:08PM (#619423)
With different sized bills:

* Sorting is O(N) [see spaghetti sort: http://en.wikipedia.org/wiki/Spaghetti_sort]

* Retrieval is O(1).

Further, retrieval is O(1) even in unordered sets, so sorting is irrelevant.

(Also, how is sorting on insertion O(log(N))? For each new bill, finding the correct spot is log(N), so you're still looking at O(N log(N)).)

Re:The Dollar Redesign Project by sp332 on Wednesday May 20, 2009 @07:01PM (#619491)
I only meant for inserting one bill, so N is the number of bills you have already. Using a binary search on a sorted list, either to find a specific denomination you want or to find the correct spot for a new bill, is O(log(N)).