News for hackers. Stuff that matters.
Re:The Dollar Redesign Project by ComputerGuru on Wednesday May 20, 2009 @02:39PM (#619053)
No it's not. Sort them upon entry into the wallet.
Re:The Dollar Redesign Project by abstractbill on Wednesday May 20, 2009 @02:44PM (#619067)
You just shifted the overhead from removal to insertion. Having different sized notes removes the overhead entirely.
Re:The Dollar Redesign Project by sp332 on Wednesday May 20, 2009 @02:56PM (#619095)
I like your idea, but sorting on insertion is O(log(N)), which is faster than searching an unordered list and just as fast as having different-sized bills.
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)).
Re:The Dollar Redesign Project by run4yourlives on Wednesday May 20, 2009 @02:53PM (#619090)
How many bills do you carry?

I live in Canada, the land of the debit card. It's rare for me to actually even carry cash anymore.

Re:The Dollar Redesign Project by axod on Thursday May 21, 2009 @04:32AM (#620095)
Also the fact that the smallest note in the UK (£5) is approx 10 times the value of the smallest note in the US ($1) helps enormously.

Seriously, what's the point of a $1 note? To irritate people everywhere trying to feed them into vending machines?