4 ms·
I'd sort into 10 piles by first digit, and then sort each pile into ten piles by second digit. This would involve looking at each note twice, so at two seconds
by OscarCunningham 6y ago
I'd sort into 10 piles by first digit, and then sort each pile into ten piles by second digit. This would involve looking at each note twice, so at two seconds per note it would take 400000 seconds, or around 7 days of two people working 8 hours a day. The small piles would have 1000 notes in them, which is easy to check in a day.
- genera1 6y ago> The small piles would have 1000 notes in them, which is easy to check in a day. By the time you could even buy an 8-bit home computer for couple hundred dollars, store all the serial numbers on a floppy and simply search through them once per day
- OscarCunningham 6y agoThat would let you check instantly if you had that dollar, but you'd then have difficulty physically finding it.
- llampx 6y agoCreate an index. Sort the notes into sets of 1000 and label them, add the label as a column into your Foxpro database.
- mywittyname 6y agoMost likely scenario, you never look sort through it again. Least likely scenario, you get $30,000 (probably like $280,000 in today's money) to dig through them all one more time.
- Dylan16807 6y agoThat would take so much more time than sorting each batch of 1000 notes, and sorted notes let you do your daily check in less than a minute.
- frombody 6y agoI'm sure I'm missing something in this discussion, but why wouldn't you just OCR the serial numbers and put the results in a textfile and sort that?