Timeline for How important is it for a programmer to know how to implement a QuickSort/MergeSort algorithm from memory? [closed]
Current License: CC BY-SA 3.0
23 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 19, 2017 at 17:09 | comment | added | Pieter B | @HristoYankov I would call knowledge about sorting algorithms and datastructures one of the staples of programming education. Knowledge about them isn't only about "best performing algorithm" knowledge about them is also: hey, I see this program behaving in this or that way and then having an educated guess about what's going on. This very important knowledge is the biggest lack in education self-taught programmers have. | |
| Sep 6, 2017 at 13:23 | comment | added | hyankov | @PieterB, I disagree. One does not need to know about 'mergesort' and 'quicksort' to Google 'best performing sorting algorithm' | |
| Sep 10, 2014 at 6:46 | review | Reopen votes | |||
| Sep 15, 2014 at 2:04 | |||||
| Sep 10, 2014 at 6:44 | history | closed |
user40980 gnat ratchet freak user53019 Bart van Ingen Schenau |
Opinion-based | |
| Sep 9, 2014 at 1:30 | review | Close votes | |||
| Sep 10, 2014 at 6:44 | |||||
| Sep 8, 2014 at 11:11 | comment | added | sakisk | You need to know their performance, use cases, etc. Knowing how to implement them by heart is something that is only required by tech companies in interviews. | |
| Sep 7, 2014 at 18:24 | history | protected | gnat | ||
| Feb 3, 2013 at 23:33 | history | edited | yannis |
edited tags
|
|
| Oct 12, 2012 at 16:25 | answer | added | hgh | timeline score: 5 | |
| Oct 11, 2012 at 18:23 | comment | added | Lee James | I'm sure it's important to memorise these algos for the frequent occurrence of Google being offline. :o | |
| Oct 7, 2012 at 15:27 | answer | added | Mike Polen | timeline score: 3 | |
| Oct 7, 2012 at 12:27 | vote | accept | John Smith | ||
| Oct 7, 2012 at 11:00 | comment | added | sakisk | Apart from the good answers mentioned below, note also that many companies require to (1) know the complexity of such algorithms, (2) be fluent in implementing them on a blackboard. | |
| Oct 7, 2012 at 3:01 | history | tweeted | twitter.com/#!/StackProgrammer/status/254778447107350528 | ||
| Oct 7, 2012 at 2:35 | answer | added | DeveloperDon | timeline score: 2 | |
| Oct 7, 2012 at 2:21 | answer | added | Peter Rowell | timeline score: 119 | |
| Oct 7, 2012 at 1:16 | answer | added | Charles E. Grant | timeline score: 48 | |
| Oct 6, 2012 at 23:02 | answer | added | scaryrawr | timeline score: 10 | |
| Oct 6, 2012 at 22:57 | answer | added | Yusubov | timeline score: 6 | |
| Oct 6, 2012 at 22:44 | history | edited | John Smith | CC BY-SA 3.0 |
added 12 characters in body
|
| Oct 6, 2012 at 22:42 | comment | added | Pieter B | You need to remember that a solution exists and when to use it. Then go into the docs and implement it. If you hadn't known about quicksort or mergesort, you'd still be using bubblesort and watch your program go to a crawl and come up with subpar solutions when data increases. | |
| Oct 6, 2012 at 22:40 | review | First posts | |||
| Oct 8, 2012 at 5:57 | |||||
| Oct 6, 2012 at 22:38 | history | asked | John Smith | CC BY-SA 3.0 |