300 karma · joined August 21, 2010
[ my public key: https://keybase.io/colegleason; my proof: https://keybase.io/colegleason/sigs/7uvBUav8qxuDB57ipJtB3pjt6kuwN0uu7OLhhdI-z3g ]
I ask because we can talk about capital gains tax rates and how low they are, but we should always talk about effective tax rates, in my opinion. That was why Subchapter S Corporations were created, I believe.
What really hurts companies is the drawn out exponential vesting periods. I believe Amazon does a package that is 15% after the first year, 40% after the second, 75% after the third, and 100% after four. Maybe my numbers are off, but you are rarely going to get new grads to commit to four years, even with that scheme. I'll take my 25% at another company after a year and move on.
Anyways, the work/experience/location/culture/salary is usually more of a factor than the vesting schedule.
I've loved this idea ever since I read about the glasses in Accelerando[1], and I can't wait for a project like this that gets to market, especially if it is open source.
[1] http://www.antipope.org/charlie/blog-static/fiction/accelera...
There's that idea in software development that it doesn't matter who came up with the idea first, but who executed it better. I actually think this is how the world should work. Who cares if you came up with an idea if you never acted on it? Why should you have the right to hold up innovation in that field?
Just get rid of "intellectual property" (at least patents) and let the people decide with their wallets.
It picks up when I drive my external monitor. Also, I did find out that a rouge process was taking about 40% CPU consistently, and it quieted down after that.
Note to companies: Don't be assholes. We don't like assholes.
I could graduate in three years or less, but I would be missing out on an experience that will most likely be extremely beneficial.
Go to job fairs like the one at upcoming ACM Reflections | Projections conference at UIUC. We have around 30 companies coming for our informal CS job fair. It's a great way to meet recruiters and get interviews.
The problem in question is 2B:
2. (30 pts.) You are given an array A with n distinct
numbers in it, and another array B of
ranks i1 < i2 < : : : < ik. An element x of A has rank u
if there are exactly u 1 numbers in
A smaller than it. Design an algorithm that outputs the
k elements in A that have the ranks
i1; i2; : : : ; ik.
(B) (20 pts.) Describe a O(n log k) recursive algorithm
for this problem. Prove the bound
on the running time of the algorithm
Source: http://www.cs.illinois.edu/class/sp11/cs473/hw/hw_03.pdfIs that possible?