andrewducker: (Default)
[personal profile] andrewducker

Date: 2017-06-21 11:16 am (UTC)
danieldwilliam: (Default)
From: [personal profile] danieldwilliam
I for one am glad that Moffat and co are turning their attention to something I'm not particularly interested in. It will be a nice break for me.

Date: 2017-06-21 11:18 am (UTC)
danieldwilliam: (Default)
From: [personal profile] danieldwilliam
Swap fishing for whale watching and see how long it takes the orcas to work out which boats are fishing and which are full of tourists.

Date: 2017-06-21 11:20 am (UTC)
danieldwilliam: (Default)
From: [personal profile] danieldwilliam
Thinking about how to cool down the Tube is going to occupy my entire brain all day.

shorts/dress

Date: 2017-06-21 11:25 am (UTC)
ext_57867: (Default)
From: [identity profile] mair-aw.livejournal.com
apparently some French bus drivers are also doing this https://twitter.com/20minutesnantes/status/877448293181145088
jack: (Default)
From: [personal profile] jack
I know what you mean, but in many ways it makes me feel worse: that the things I'm good at are basically worthless, and wonder if "looking good in meetings" is the only skill people are valued for.

Date: 2017-06-21 12:23 pm (UTC)
nancylebov: blue moon (Default)
From: [personal profile] nancylebov
https://www.youtube.com/watch?v=5sSb1qF7m3w

Parrots dance-- there are a zillion youtube videos. What's more they're inventive about the choreography.

https://www.youtube.com/watch?v=sg0aARl_U88

Dogs mostly don't dance-- there are competitions of people dancing with dogs, but the dog is just paying attention to the human. However, here is a rare exception with a dog dancing on its own.

https://www.youtube.com/watch?v=sg0aARl_U88
Edited Date: 2017-06-21 12:28 pm (UTC)

Date: 2017-06-25 04:18 pm (UTC)
nancylebov: (green leaves)
From: [personal profile] nancylebov
Thanks. I didn't realize the music track was added for the dog.

Date: 2017-06-21 12:33 pm (UTC)
calimac: (Default)
From: [personal profile] calimac
1. As husband of a musician, I can say with assurance that cats, at least, have no appreciation of human music whatever.

2. As a non-programmer, I could not follow anything in that article. However, I had no problem understanding your comment on it, which I think shows that while other programmers speak programming, you speak English.

I did once get a library cataloging job by being the only candidate to find the errors in the written test of competence. (And no, they weren't put in deliberately. The test wasn't written by the employers, and they didn't notice the errors until I pointed them out.)

3. And they make the Queen read all that stuff aloud? It's not easy being Queen.

Date: 2017-06-21 12:47 pm (UTC)
momentsmusicaux: (Default)
From: [personal profile] momentsmusicaux
An associative array in PHP, but I have *no* idea how long the lookup would take!

Date: 2017-06-21 12:54 pm (UTC)
momentsmusicaux: (Default)
From: [personal profile] momentsmusicaux
Oh yeah, I definitely know that isset($array['key']) is faster than in_array($array, 'value')[*], but I couldn't tell you anything specific in big O notation or ratios.

The other advantage of using a keyed array is that you prevent duplicates when you're adding items.


* I can never remember parameter order here, PHP is inconsistent with the order of needle and haystack parameters. Thanks PHP!
Edited Date: 2017-06-21 12:54 pm (UTC)

Date: 2017-06-22 08:55 am (UTC)
jack: (Default)
From: [personal profile] jack
I think that's the important thing. Knowing that an associative array is O(ok) and looking through an array is O(terrible) is the amount of knowledge you need in practice.

Most programmers never need to actually design an algorithm of this sort.

Date: 2017-06-22 10:04 am (UTC)
simont: A picture of me in 2016 (Default)
From: [personal profile] simont
Knowing that an associative array is O(ok) and looking through an array is O(terrible) is the amount of knowledge you need in practice

And don't forget the third clause, that looking through an associative array is O(godwhatareyouevendoing).

Date: 2017-06-22 10:19 am (UTC)
jack: (Default)
From: [personal profile] jack
:)

I wonder what the worst factors of unnecessary overhead are. There's plenty of examples of being O(n^2) when you could have been O(n) (surprisingly easy to do). And of being O(n) when you might be (1) as in these examples (when you really should notice something amiss).

I was also wondering if anyone's accidentally written a random-indexing (ie. generate a random number, if it's the desired index continue, else repeat), although that wouldn't have a worse complexity than a loop for a single index, even though it's clearly worse.

Date: 2017-06-22 10:30 am (UTC)
simont: A picture of me in 2016 (Default)
From: [personal profile] simont
A colleague of mine spotted a bug yesterday in a piece of test automation, in which a specification of a list of test cases had contained some tiny easy-to-miss lexical error (I forget exactly what, but something along the lines of putting an operator inside rather than outside a critical pair of parens) and as a result two long sublists of test cases had been fed to the Cartesian product operator instead of the concatenation operator.

It was only two lists being combined, fortunately, but the same sort of typo could just as easily have done the same thing to n lists, which would have turned a more or less linear amalgamation into an exponential one.

(Though I suppose the worse it gets, the more likely you are to actually notice when you investigate why the test system seems to be spending forever running indistinguishable variants of the test suite in question. Perhaps the real limiting factor on this question is not 'how egregious a consequence can you imagine for a trivial code error?' but 'how egregious a consequence can you imagine going undetected for some reason?'.)

Date: 2017-06-21 01:02 pm (UTC)
drplokta: (Default)
From: [personal profile] drplokta
If you wanted to be difficult in the interview you linked to, you could start to go on about Bloom filters.

In other news, my father was 53 when I was born. So there's clearly nothing in the assertion that you're more likely to be geeky if you had an older father.

Date: 2017-06-21 03:54 pm (UTC)
cmcmck: (Default)
From: [personal profile] cmcmck
I like that guy's style :o)

Dress codes do seem somewhat idiotic in present weather conditions!

Date: 2017-06-21 04:12 pm (UTC)
ckd: (cpu)
From: [personal profile] ckd
Many years ago I was interviewing for a systems engineer job. On my application, I'd self-ranked a number of languages and technologies including Python.

During one interview I was asked how I would implement a set data type in my language of choice. I asked if I could assume a reasonably modern installation of Python, say 2.4 or later, and was told that I could.

"In that case I'd use the built-in set type."

I then proceeded to reimplement sets in Perl using associative arrays, since that showed that I understood the details involved....

Date: 2017-06-22 04:20 pm (UTC)
conuly: (Default)
From: [personal profile] conuly
Older fathers have geekier sons

For a given, highly limited definition of "geeky".

Of course, the question here is the same as when they tell us that older fathers are more likely to have autistic children - is it that something happens to the sperm, or that men with those qualities are more likely to wait to have children?

June 2025

S M T W T F S
1 2 3 4 5 6 7
891011121314
15161718192021
22232425262728
2930     

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags
Page generated Jun. 7th, 2025 10:09 pm
Powered by Dreamwidth Studios