Print Story meh?
Diary
By MillMan (Thu Jul 25, 2013 at 05:42:59 PM EST) (all tags)
meh.


This year has consisted of mediocre choices and mediocre luck.

I had an interview for a massage job about a month ago which I didn't get. The job had some red flags but it would have been fine for a first job. Massage jobs are quick to get and leave unlike tech jobs.

Last week I had an interview for a tech job that I botched pretty well. Bad enough that it's kind of funny - I screwed up the CS equivalent of those "tell me how a bubble sort algorithm works" kinds of interview questions used to weed out dumb people. There's still a tiny chance I will get it but it's entirely likely they will find someone who interviewed better and who is as qualified. In fairness it was my first interview in 7 (!) years and I've been off work for a year. It didn't even occur to me that I might have forgotten how to answer those basic weeder questions.

Other than that life leaves me scratching my head in confusion.

< Now I want some fried chicken | The world's mine oyster >
meh? | 6 comments (6 topical, 0 hidden) | Trackback
But by Driusan (4.00 / 1) #1 Fri Jul 26, 2013 at 08:02:31 AM EST
Were you on time for the interview?

--
Vive le Montréal libre.
yep by MillMan (2.00 / 0) #5 Fri Jul 26, 2013 at 02:47:04 PM EST
I'm never late to anything.

"Just as there are no atheists in foxholes, there are no libertarians in financial crises." -Krugman

[ Parent ]
Implementing a sort? by wiredog (4.00 / 1) #2 Fri Jul 26, 2013 at 08:22:54 AM EST
Is there any language where you couldn't call some variant of "list.sort()" or "sort(list)"?

Earth First!
(We can strip mine the rest later.)

Hrm by gazbo (2.00 / 0) #3 Fri Jul 26, 2013 at 09:48:57 AM EST
Well ignoring the missing-the-point-ness, I recently (a few years back) programmed an embedded system whose built in sort function turned out to be implemented using bubble sort.  Unoptimised bubble sort(*).  Combined with the shitty CPU and interpreter, this added about 3 seconds onto startup time as I asked it sort ~100 items.

So yeah, I had to implement my own sort method, on a modern system, for my real job.  How depressing.

* I inferred the sort algorithm by counting how many times the comparator callback was called.  It was always exactly n(n-1)/2.


I recommend always assuming 7th normal form where items in a text column are not allowed to rhyme.

[ Parent ]
dunno by MillMan (4.00 / 1) #4 Fri Jul 26, 2013 at 02:42:35 PM EST
I think I had to implement it way back in my fortran class and maybe scheme too.

"Just as there are no atheists in foxholes, there are no libertarians in financial crises." -Krugman

[ Parent ]
hardware design by garlic (2.00 / 0) #6 Mon Jul 29, 2013 at 12:01:44 PM EST
doing embedded hardware design, I had to sort a small list of hardware generated false targets based on when they needed to be sent to the antenna for jamming. It was a small list, and I had a lot of time, so I just did cocktail shaker sort (a bubble sort optimization)


[ Parent ]
meh? | 6 comments (6 topical, 0 hidden) | Trackback