Comments on: What You Need to Know to Work For Me http://ripper234.com/p/what-you-need-to-know-to-work-for-me/ Stuff Ron Gross Finds Interesting Fri, 27 Jan 2012 03:20:29 +0000 hourly 1 http://wordpress.org/?v=3.3.1 By: ripper234http://ripper234.com/p/what-you-need-to-know-to-work-for-me/comment-page-1/#comment-355 ripper234 Wed, 13 Feb 2008 16:50:00 +0000 http://localhost/p/what-you-need-to-know-to-work-for-me/#comment-355 I've always hated assembly. For me, it's always some other people had to do, but my best qualities are in the domain of more abstract programming languages. I would have definitely failed that test :)<br/><br/>What I love about programming is that it's enough to do something once. If you do it once, you box it up and can reuse it however you want. The more advanced programming languages we have today keep inventing new ways to reuse code, which is great for a lazy person like me (I think laziness is a desired quality in a programmer). I’ve always hated assembly. For me, it’s always some other people had to do, but my best qualities are in the domain of more abstract programming languages. I would have definitely failed that test :)

What I love about programming is that it’s enough to do something once. If you do it once, you box it up and can reuse it however you want. The more advanced programming languages we have today keep inventing new ways to reuse code, which is great for a lazy person like me (I think laziness is a desired quality in a programmer).

]]> By: Eli Benderskyhttp://ripper234.com/p/what-you-need-to-know-to-work-for-me/comment-page-1/#comment-354 Eli Bendersky Wed, 13 Feb 2008 16:36:00 +0000 http://localhost/p/what-you-need-to-know-to-work-for-me/#comment-354 When I was still young and innocent, I was interviewing to Intel as a student (it was the year 2000). They asked me the famous "an ant climbs the stairs - either 1 or 2 at the time, how many ways to reach the Nth step" to which the answer is Fibonacci.<br/><br/>When asked to provide a solution I, naturally, wrote the recursive one in C. For which I was severely punished, because the interviewer slyly grinned and asked me to write it in assembly.<br/><br/>A double recursion in assembly. Now that's fun ! For me as a 3rd semester student it wasn't easy, but eventually I guess I managed, because they accepted me (though I went to IBM). When I was still young and innocent, I was interviewing to Intel as a student (it was the year 2000). They asked me the famous “an ant climbs the stairs – either 1 or 2 at the time, how many ways to reach the Nth step” to which the answer is Fibonacci.

When asked to provide a solution I, naturally, wrote the recursive one in C. For which I was severely punished, because the interviewer slyly grinned and asked me to write it in assembly.

A double recursion in assembly. Now that’s fun ! For me as a 3rd semester student it wasn’t easy, but eventually I guess I managed, because they accepted me (though I went to IBM).

]]>