Scattered things...
May. 11th, 2006 02:14 pm- I remain skeptical of quite a few things that Hillary Clinton stands for - increased censorship is pretty much always wrong, and she's too willing to roll over and find the "middle ground" between the centrist position and the loony right - but linking the federal minimum wage to the congressional wage is a stroke of genius.
- 12 catches of 5 clubs. And I could count them myself instead of having someone else tell me how many I got. That was most pleasing.
- Conference submission date is May 16th. Work work work. Then I am done with the research project that is turning out to be kind of orthogonal to the research I want to do. Then it's all area exam all the time. Work work work. Then the term is over.
- And this summer I am teaching "Intro to Programming" in Python in a 4-week intensive (7/24-8/16). Using John Zelle's book based on the advice of several people. I am psyched. The rest of the summer is going to be spent biking and hanging out and reading and recovering from a relatively rough year of grad school.
no subject
Date: 2006-05-11 09:21 pm (UTC)yeah i'm thinking some sort of pod-creature thing is going on here, Hilary is certainly not on my list of "most beloved or courageous politicians".
I see it as pretty much a posturing move, legislators across the board have a tendency to frequently sponsor/write bills they know will have no chance of getting even through committee just so they can look good to the folks at home.
no subject
Date: 2006-05-11 09:22 pm (UTC)no subject
Date: 2006-05-11 09:26 pm (UTC)Go you!
no subject
Date: 2006-05-11 09:47 pm (UTC)no subject
Date: 2006-05-11 10:00 pm (UTC)no subject
Date: 2006-05-11 10:11 pm (UTC)no subject
Date: 2006-05-11 10:22 pm (UTC)Testing your assertion (with Python2.3 on Debian Stable)
Date: 2006-05-11 10:29 pm (UTC)import random import time for p in range(6,21): a = [ 1 for _ in range(2**p) ] elements = [ random.randint(0,len(a)-1) for _ in range(1024) ] s = time.time() for e in elements: _ = a[e] e = time.time() print s - e, 2**pGives us:
So list access time does grow, but it's pretty miniscule and probably due to CPU cache issues, and it is *certainly* is a far cry from O(n).
no subject
Date: 2006-05-11 10:33 pm (UTC)It is amazing that people will pay an extra dollar to watch me juggle lemons! As if alcohol wasn't expensive enough.
no subject
Date: 2006-05-11 10:42 pm (UTC)no subject
Date: 2006-05-11 10:48 pm (UTC)no subject
Date: 2006-05-11 10:49 pm (UTC)Lookup is O(1), but delete and insert are O(n).
no subject
Date: 2006-05-11 10:50 pm (UTC)no subject
Date: 2006-05-11 10:55 pm (UTC)Sadly, it may still be better than what we have now.
no subject
Date: 2006-05-11 10:56 pm (UTC)no subject
Date: 2006-05-11 10:56 pm (UTC)no subject
Date: 2006-05-11 10:58 pm (UTC)no subject
Date: 2006-05-11 11:01 pm (UTC)your idle poor,
your idle masses yearning to breathe free
The idle refuse of your teeming shore.
Send these, the idle, tempest-tossed, to me:
I lift my lamp beside the golden door.
no subject
Date: 2006-05-11 11:09 pm (UTC)no subject
Date: 2006-05-11 11:35 pm (UTC)I guess I'll have to re-evaluate that book now too.
no subject
Date: 2006-05-12 12:14 am (UTC)no subject
Date: 2006-05-12 12:54 am (UTC)minimum yearly salary (per company) = .02*CEO's total earnings+bonus+value of benefits, etc OR .20*Congresscritter's salary, whichever is greater.
And then calculate hourly wages based on the standard 40 hour week.
Sadly, neither Hillary nor anyone else can propose that sort of thing.
no subject
Date: 2006-05-12 12:55 am (UTC)no subject
Date: 2006-05-12 01:09 am (UTC)B-trees divide things into blocks (of, say, 512 or 4096 entries) and within a block they work just like arrays. So for the common case of small lists, you have one extra check to determine that the root of the B-tree is also a leaf node (i.e., it's entries are data not more B-tree nodes). Once that's determined, you jump to code that works just like the current array code.
B-trees are good because they're fast for small lists *and* they give you O(log n) performance for big lists.
no subject
Date: 2006-05-12 01:34 am (UTC)