395 karma · joined March 7, 2012
This is only seen in tests with small animals such as mice or rats. Please cite a source showing that this result is also seen in humans.
1. Employees paid less than the average 2. Employees paid equal to or more than the average 3. Management.
Reactions are:
1. Unhappy: Being paid less than average 2. Happy: Being paid more than average 3. Unhappy: Half of their employees now know they are being paid less and are unhappy.
Edit: You're free to cite examples of children who "aren't that lucky" and had their upbringing maliciously altered by viewing internet pornography.
If you want to see examples of competitions like this, many teams for Battlecode hosted by MIT have open sourced their code.
They bypassed that student's security and his website, not the "administrators at MIT" and "their website".
Resulting in a negative.
When you aren't in insert mode, it's easy to navigate to specific lines (g), scan quickly through the document (^D, ^B), scan through lines (b,e), change/delete stuff (c,d,C,D,s,etc. Quick commands like ci" will Change Inside Quotes, so for example you can edit strings very quickly.), and search (/, , #, n, N).
As well, like tlunter said, vim is very portable. If you have to hop on someone else's computer to change some of their local code, there almost certainly* will be an editor that you can use quickly and efficiently. It also loads very quickly.
Vi commands: ^D ^E ^B . J and probably more that I haven't tried.
Possibly Vim commands: * #
U is functioning completely incorrectly. Try dd, U on line 3 in the example.
It also wasn't allowing me to hit <ESC> (OSX 10.6, Chrome 19)
(All this isn't Filepicker's fault. It's whomever's that wrote the choppy JS version of Vi. But if you want to show off Vi in the browser, you can't make me feel like a broken machine when I try to use it.)
For those who want it direct: http://www.infoq.com/presentations/What-Sucks-about-Clojure-...
We also understood that it was as n -> infinity, hence why f(n) = 2x^4 would have a larger growth rate than g(n) = x^2 + 5000. When you're talking about scalability when programming, you're going to have to understand big-O, how constant factors come into play (why Floyd-Warshall at O(n^3) is often better in practice), and how big-\Theta works. If not, you're eventually going to make a mistake and slow everything down.
Let's say you want a data structure that performs three operations. Insert, Delete, and Find (as in, 'is this in the database?'). The intuitive sense may come from saying, "Linked-Lists would be horrible for this! Each operation would be slow." (O(n)) The practiced programmer may say, "I can keep the data sorted and use an Array. Those would probably be faster." (O(lg n)) However, if you learned a little more CS and how hashes work, you would know that they are constant time for all three operations. You never had to waste time thinking about which choice to make because you know how hashes are implemented and that they specialize on those operations running in constant time.
Besides, big-O notation takes no time at all to learn. I learned it's theory as a freshman in high school during algebra II when we wanted to know which of two polynomials grew faster. Take the most significant part, rip off the constants, and that's its growth rate.