Timeline for How important is it for a programmer to know how to implement a QuickSort/MergeSort algorithm from memory?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 14, 2012 at 8:06 | comment | added | IAdapter | @CharlesE.Grant most of the time interviwer doesn't check if you got skills you need to do your job (I can't remember last javascript/css question I was asked and I do webapps). | |
| Oct 13, 2012 at 22:37 | comment | added | Charles E. Grant | @IAdapter, surely you jest! I know from my own experience that the knowledge and skills I needed for my first job writing TROFF macros for a shrink-wrap software company are very different from the ones I need for my current job in a computational biology lab. | |
| Oct 12, 2012 at 20:50 | comment | added | IAdapter | I disagree with 2nd point. all jobs are the same, only interviewer changes. this one knows sorting very well and thinks every good programmer must know sorting, because that is all he knows and cares about. | |
| Oct 11, 2012 at 19:04 | history | edited | fredoverflow | CC BY-SA 3.0 |
deleted 3 characters in body
|
| Oct 7, 2012 at 20:05 | comment | added | drxzcl | I do not think it's possible to understand QuickSort without remembering QuickSort. It's not a complicated and arcane thing, it's just two generic ideas combined. The same thing applies to merge-sort, but there you have just one idea :P | |
| Oct 7, 2012 at 1:16 | history | answered | Charles E. Grant | CC BY-SA 3.0 |