|
Sleepsort 
|
#
¿
Aug 19, 2011 16:42
|
|
|
|
| # ¿ Apr 26, 2024 10:36 |
|
|
I first saw Sleepsort as an interview question actually. It was given as an anonymous function with non-descriptive variable names and the interviewee had to say what it does and find the bugs in it. I think a good question for gauging basic familiarity with sorting algorithms would be to ask what the primary difference is between Mergesort and Quicksort.
|
|
#
¿
Aug 20, 2011 04:38
|
|
|
pokeyman posted:"Primary" seems like an odd qualifier to give there, as sometimes stability is most relevant while other times worst-case runtime would be. But to describe a difference you have to address both those. That doesn't preclude the fact that either can be the most critical in different contexts. Anyways, I should have qualified: I meant primary implementation difference, as in with Quicksort the actual comparisons and swaps are done on the way down the stack whereas with Mergesort they are done on the way up. shrughes posted:I'd consider it a severe mark against a person even after years away from school not to know what quick sort and merge sort are, if they had once known. It means they didn't find sorting algorithms interesting enough, or data structures and algorithms in general interesting enough, for them to remember anything about them. They're the quintessential O(n log n) sorting algorithms! If a person can't remember how they work, what can they remember? What a vector is? How to write foreach loop? How link list get insert? Do these people just have a table of knowledge mapping operations of the Java standard library to their big O running times? I disagree that you can equate sorting algorithms with those other concepts. Vectors, loops, and linked lists are all pretty intuitive concepts once you have seen and used them. Not to mention it is much more important to understand their details for day-to-day programming than it is to remember the gooey details of Mergesort.
|
|
#
¿
Aug 20, 2011 18:14
|
|
|
I don't think it's an abuse of notation. When you say "This algorithm is O(f)" without any qualifiers you're just using some agreed upon defaults. First, you're talking about the running time of the algorithm rather and space or power consumption. Second, you're talking about the worst case running time over all possible inputs. If you want to talk about something else, like space complexity, average running time, or running time with high probability, then you should qualify it as such.
|
|
#
¿
Aug 21, 2011 21:23
|
|
|
I don't think the point is "Can you come up with and analyze algorithms cause that's what you'll be doing all day?" so much as "Are you a smart fucker who's comfortable enough with discrete logic and making machines do things to be able to adapt to whatever project we throw you into?"
|
|
#
¿
Aug 23, 2011 16:51
|
|
|
Asking a candidate to write-syntactically correct code with formatted output and file I/O and then read it back to you over the phone has to be the dumbest idea I've ever heard.
|
|
#
¿
Sep 8, 2011 03:09
|
|
|
Even funnier because the gist of the scripting section is "Why would you do this in a needlessly inefficient way when there are already tools to ease the process?" Uh...
|
|
#
¿
Sep 8, 2011 03:25
|
|
|
Ithaqua posted:He also predicts which candidates will be inferior based on their preference of text editor. Haha, yeah, just got to that part. "Little nublet never heard of VIM???  "
|
|
#
¿
Sep 8, 2011 03:41
|
|
|
The only codebase I've worked in that was riddled with interfaces and heavily unit tested was also constantly full of integration bugs. That said, it would be really handy if the BCL had interfaces for HTTP requests, event logs, other out-of-proc APIs because they are super handy for writing functional tests.
|
|
#
¿
Sep 24, 2016 21:14
|
|
|
Yeah, I've never met a single person who gloated about that, only the guy who regularly missed our 11 AM standup and sometimes was MIA for 24 hours at a time and thought that we were gloating when we asked him about it.
|
|
#
¿
Oct 6, 2016 16:57
|
|
|
I think y'all are deeply insecure about sleeping so late.
|
|
#
¿
Oct 7, 2016 15:48
|
|
|
ToxicSlurpee posted:From my understanding a good QA person tests every path through the code, making sure that improper stuff throws the right exceptions and is handled properly. A good QA person documents bugs, test failures, and whatever in detail. A bad QA person only tests the happy paths and says things like "it crashed when I clicked on *thing.*" For the most part, yes, but I've also experienced the bad QA person that was way too aggressive and could not conceptualize the idea that too much QA can be bad if it leads to slow and infrequent releases.
|
|
#
¿
Dec 17, 2016 23:58
|
|
|
It depends on your exact expectations but ideally they would also have some minor technical understanding about how web pages get served up, client-side vs server-side code, etc. Also familiarity with non-functional requirements like performance, accessibility, multi-lingual support. Understands the concepts of bug severity and priority.
|
|
#
¿
Apr 24, 2017 20:14
|
|
|
Doghouse posted:I never had any success at all with recruiters. They almost never got me interviews, I think actually only once. And they often don't understand anything about software development, so I found it very frustrating to talk to them. Like seriously a lot of them don't even understand, on a basic level, the difference between, say, Java, Agile, and Unit Testing. Those are just three "skills" you should have. Candidate is able to rapidly context switch between Node.js and Strong Architectural Design.
|
|
#
¿
May 15, 2017 16:32
|
|
|
|
| # ¿ Apr 26, 2024 10:36 |
|
|
Pollyanna posted:I wonder if I will ever apply to a job when I'm 40 that asks for my college GPA. That poo poo cannot be sustainable. I've never had a job explicitly ask for my GPA. Maybe when I applied for my summer internship? Can't remember back that far. I did have it on my resume until I had about 3-4 years of experience.
|
|
#
¿
Jun 23, 2017 20:18
|
|