3 ms·
> The standard solution to any hard problem [which is] is to find someone who solved it already and steal their answer. Reminds me a little of the Feynman algo
by erikb 12y ago
> The standard solution to any hard problem [which is] is to find someone who solved it already and steal their answer.
Reminds me a little of the Feynman algorithm. 1) Write your question into google. 2) Open the first three results. 3) Copy what you find.
Does it already have a name?
- bobbles 12y ago"How should I handle version control?" Spat these out: http://programmers.stackexchange.com/questions/129543/what-is-the-best-way-to-handle-product-versioning-and-branching-of-long-term-pro http://programmers.stackexchange.com/questions/129543/what-i... http://git-scm.com/book/en/v2/Getting-Started-About-Version-Control http://git-scm.com/book/en/v2/Getting-Started-About-Version-... http://git-scm.com/ http://git-scm.com/ ..not bad
- stingraycharles 12y agoAm I confused, or is this the opposite of the Feynman algorithm? Using your variant of the Feynman algorithm, I found [1] : 1. Write down the problem. 2. Think real hard. 3. Write down the solution. [1] http://c2.com/cgi/wiki?FeynmanAlgorithm http://c2.com/cgi/wiki?FeynmanAlgorithm
- erikb 12y agoSame process, but instead of using your brain you use google.
- IanCal 12y ago"Stacksort" is probably the right thing to bring up here. A sorting algorithm that searches SO and copies code from there until the list is sorted. Origin: https://xkcd.com/1185/ https://xkcd.com/1185/ Implementation: http://gkoberger.github.io/stacksort/ http://gkoberger.github.io/stacksort/
- erikb 12y agoVery nice! I already forgot that one!