shrughes

37 ms·

331.
by shrughes 17y ago
Because if foo contains "f" and bar contains "b", then your scheme would have (foo + " " + bar) contain "fb" and not "f b"
332.
by shrughes 17y ago
I could. Is your filesize 11? Maybe your editor added a newline character. C:\>ls -l blah2.txt -rwx------+ 1 shrughes ???????? 11 May 18 06:39 blah2.txt C:\>cat blah2.txt 1 collision C:\>openssl dgst -sha
333.
by shrughes 17y ago
What languages do you have in mind?
334.
by shrughes 17y ago
Points seem easier to get now than back then. There are more upvoters.
335.
by shrughes 18y ago
Yes. When overloading prefix and postfix increment, there are two functions to write, and the postfix version returns a copy of what you've incremented. It's impossible for a compiler to optimize this away in the general situation.
336.
by shrughes 18y ago
Or with C++. There's no reason to adopt i++ sometimes and ++i other times depending on what the type is.
337.
by shrughes 18y ago
If you were confused in such a way you'd end up thinking that i would be incremented with "i++" before the loop body ran. For "++i" to be confusing would be seriously messed up.
338.
by shrughes 18y ago
The fact that our broadband level is lower than other countries' doesn't mean that it is "bad." Here's an alternate theory that explains the difference: Other countries have governments that like spending excess amount of money on things.
339.
by shrughes 18y ago
You're not reading what I've said, are you.
340.
by shrughes 18y ago
It's completely different behavior depending on the type of operator. Edit: And apparently it even respects the associativity of the operator! There is nothing gained by making the language more complicated just to cut a few characters.
341.
by shrughes 18y ago
My God. Here's their example of the "reduction meta operator". say [+] 1...5; # sum say [*] 1...5; # product say [<] @list; # is @list strictly ordered ascendingly? What the hell? With [*] they go for a
342.
by shrughes 18y ago
It seems more like an example of why the interviewee should get a good night's sleep before the interview.
343.
by shrughes 18y ago
I don't understand this. What do you mean by mental associations?
344.
by shrughes 18y ago
Typo alert! You meant int i = lowerBound + (upperBound - lowerBound) / 2;
345.
by shrughes 18y ago
Well, I saw it before, and it took a several minutes then, maybe 5 or 15, I don't really remember. Then you have to consider that companies like D.E. Shaw end up hiring people who would end up giggling at how long somebody slow like me wou
346.
by shrughes 18y ago
It's definitely answerable in an interview situation. Some people should be able to answer it, no problemo, in a minute or two.
347.
by shrughes 18y ago
Well, there is certainly have fear, uncertainty, and doubt, but rightfully so.
348.
by shrughes 18y ago
No, you're completely dodging the issue by saying some library functions, not written in Ruby, are not slow, and then talking about development time, which has nothing to do with the slowness people are talking about. The last time I check
349.
by shrughes 18y ago
Rand wasn't an anarchocapitalist.
350.
by shrughes 18y ago
I'm pretty sure he meant Sama, unless he meant sama: http://news.ycombinator.com/user?id=sama
351.
by shrughes 18y ago
This is the second-most-awesome comment on HN.
352.
by shrughes 18y ago
Well, for the cases on planarity.net, it seems O(n) to me. Or maybe something like O(n log n)
353.
by shrughes 18y ago
You look at the effect.
354.
by shrughes 18y ago
Well, since you asked for an obvious reason, and not a completely separate derivation, here it is. The process of rotating a repeating decimal expansion x by 1 digit means adding some integer n and dividing by 10. (n + x) / 10 = 2x Simplify
355.
by shrughes 18y ago
Spoiler Alert! The number in general (I said, Spoiler Alert!) can be written as _y_ _x_ where 0 <= x <= 9 and the value of the number is 10 y + x. Then it must satisfy for some k 2 (10 y+x) = (10^k) x + y Simplify that and you can
356.
by shrughes 18y ago
Because the decimal expansion of 19 repeats after 18 digits. That means all the fractions 1/19 .. 18/19 are just rotations of each other. And 20/19 = 1 + 1/19, which means that 2/19 is a single rotation away. If you've ever noticed that 14
357.
by shrughes 18y ago
A lot of (but not all of) what you end up getting from Lisp macros ends up being not needed to be implemented with macros in Haskell anyway.
358.
by shrughes 18y ago
I check reddit, then check HN, then check reddit again, then realize I meant to check proggit. At this point in time, i forget that I've visited HN, so I check HN again. But then maybe somebody posted something interesting that I missed, s
359.
by shrughes 18y ago
They are the kind of obvious thing that many people would invent for themselves, yes. But the question was about algorithms that changed the world, not about non-obvious algorithms. I would argue that in the case of Monte Carlo methods, co
360.
by shrughes 18y ago
In particular, > Please don't submit comments complaining that a submission is inappropriate for the site.

More ›