17 ms·
Unpythonic Python
- rodrodrod 13y agoNeat! I'd be interested in seeing pythonic solutions written in other languages (to the extent that those languages may allow 'Pythonic' style), too. I find it fascinating to see how certain languages will, for one reason or another, trend towards certain design patterns and styles.
- hcarvalhoalves 13y agoActually, most Python I write (influence from reading experienced programmers) tends to the last one, although it's semi-jokingly: def fizzbuzz(n): return 'FizzBuzz' if n % 3 == 0 and n % 5 == 0 else None def fizz(n): return 'Fizz' if n % 3 == 0 else None def buzz(n): return 'Buzz' if n % 5 == 0 else None def fizz_andor_maybenot_buzz(n): print fizzbuzz(n) or fizz(n) or buzz(n) or str(n) map(fizz_andor_maybenot_buzz, xrange(1, 101)) It's pleasing to use HFOs in Python, as long as you don't abuse lambdas. Also, some functional types like `defaultdict` can be used to describe code/business logic with datastructures rather than a bunch of if's, keeping things tidy.
- gamegoblin 13y agoI use defaultdict all the time. Very often when describing graphs. g = defaultdict(dict) Allows you to do g[node1][node2] = edge_weight without checking if node1 exists, and if not, saying g[node1] = {} Also a neat trick (of dubious use) is: def auto_tree(): return defaultdict(auto_tree) Gives you infinitely nested defaultdicts.
- hcarvalhoalves 13y agodefaultdict is really multipurpose, quick trees is only one of the neat tricks. I like the following definition :) >>> Tree = lambda: defaultdict(Tree)
- marcosdumay 13y agoI'm trying very hard to write Python in VB.Net at my job. But I've not been very successful, Python is very flexible.
- tghw 13y agoPlaying code golf with Python, this is the shortest I could get: https://gist.github.com/tghw/3702360 https://gist.github.com/tghw/3702360 Definitely a little unpythonic.
- pcmonk 13y agoIn the comments, someone gave this nice solution: for x in range(100): print x%3/2*'Fizz'+x%5/4*'Buzz' or x+1
- segmondy 13y agoThat's more like it! First time I heard about Fizzbuzz, I solved it in PHP. I stay amazed at the 100 lines solutions. for ($i = 1; $i <= 100; $i++) { $str = str_repeat('Fizz', !($i%3)&1) . str_repeat('Buzz', !($i%5)&1); echo $str ? "$str\n" : "$i\n"; }
- gamegoblin 13y agoSomething annoying about python is that the word "lambda" is so long for what are supposed to be one-off functions. You have f=lambda x,y=1,a='Fizz',b='Buzz': ... But it's actually shorter to say def f(x,y=1,a='Fizz',b='Buzz'): ... I much prefer Haskell's \x -> x Style lambdas.
- ot 13y ago> But it's actually shorter It's not: with def() you have to explicitly write return, while with lambda it is implicit.
- gamegoblin 13y agoYou don't need a return, just a print (since we are doing FizzBuzz). For tghw's solution to work you'd have to have a print outside of the function call (since you can't print from a lambda). With the def, you can print inside of the function (and don't need a return, since you're just printing).
- deleted 13y ago[deleted]
- solox3 13y agoThis was what one of our Java coworkers wrote a while back: https://gist.github.com/1337/8155054 https://gist.github.com/1337/8155054
- gagege 13y agoThat kind of code could make sense when you're using a very opinionated API, that is designed (for better or worse) with patterns in mind, such as Android. But, when you start bringing that style of coding outside of that environment... Yuck.
- elwell 13y agoI don't think you need to even explicity say he's used to Java. Wow... I've never felt the need to the use the factory technique.
- marcosdumay 13y agoI use factories a lot when using Django... But, of course, in Python they are functions that return a class, not classes. Interfaces instead are completely unpythonic. Or, maybe I should call them antipythonic?
- epidemian 13y agoAt least they followed the snake_case name convention for method names (albeit getters) ;)
- anon4 13y agoIt won't work on py3 because map is a generator. Tell him to use list comprehensions: [setattr(self, x, kwargs[x]) for x in kwargs.keys()] Though of course that is a bit too slow and he should do self.__dict__.update(**kwargs) or for maximum correctness import os; os.remove(__file__)
- th0ma5 13y agoReminds me of "Evolution of a Python Programmer" https://gist.github.com/fmeyer/289467 https://gist.github.com/fmeyer/289467 ... seems like I've perhaps seen other versions of this?
- platz 13y agoThe Evolution of a Haskell Programmer http://www.willamette.edu/~fruehr/haskell/evolution.html http://www.willamette.edu/~fruehr/haskell/evolution.html
- acomjean 13y agoWe used to have ADA-TRAN code at work. Fortran code migrated to Ada. It was awful, but it worked so we left it. It been commented the Perl I write, it written like C programmer.
- jevinskie 13y agoThe superfluous semicolons on line endings in the C example gave me a chuckle.
- drivers99 13y agoHe forgot one on the "i += 1" (which would be i++ in a for loop but Python doesn't have that operator). But that whole line is weird, because I think the C example should use a "for" loop, not increment the main counter at the top of a while loop, even if it has to use "for i in range(1, 101)" like in pythonic python. A C programmer like me (who loves python too) would immediately think "for (i = 1; i <= 100; i++)" for that (although counting from 1 is strange, it's what the problem asks for).
- eriktaubeneck 13y agoThis is what I originally had but I felt that the Python `while` was actually a bit more true to the way a C for loop is constructed (and `range` seems a very not C thing to do.) It's not perfect!
- Nav_Panel 13y agoHeh, in the C version I wish that "value = str(i);" was replaced with "value = "%d" % (i);" Format strings feel like C. And not the fun parts of C.
- tormeh 13y agoJava doesn't have to be written like that you know. Idiomatic code is overrated in my opinion. Make it readable and correct, fuck the rest.
- platz 13y agoThe actual Java implementation: https://github.com/EnterpriseQualityCoding/FizzBuzzEnterpriseEdition https://github.com/EnterpriseQualityCoding/FizzBuzzEnterpris... A non-programmer’s solution to “Fizz Buzz” https://news.ycombinator.com/item?id=4853509 https://news.ycombinator.com/item?id=4853509 FizzBuzz Still Works http://www.globalnerdy.com/2012/11/15/fizzbuzz-still-works/ http://www.globalnerdy.com/2012/11/15/fizzbuzz-still-works/ FizzBuzz with CSS http://dabblet.com/gist/2628265 http://dabblet.com/gist/2628265
- hit8run 13y ago+1 for the pythonic version -1 for the weird rest this assures me that python is the right language for me :)
- JackC 13y agoA highly Pythonic, Easier to Ask Forgiveness than Permission[1] version: FIZZ=3 BUZZ=5 cache = {} for i in range(FIZZ-1, FIZZ*BUZZ, FIZZ): cache[i] = 'Fizz' for i in range(BUZZ-1, FIZZ*BUZZ, BUZZ): try: cache[i] += 'Buzz' except KeyError: cache[i] = 'Buzz' for i in range(100): try: print cache[i%(FIZZ*BUZZ)] except KeyError: print i+1 [1] https://docs.python.org/2/glossary.html#term-eafp https://docs.python.org/2/glossary.html#term-eafp A generator version: from itertools import izip, islice def fizzes(): i=0 while True: yield '' if i%3 else 'Fizz' i += 1 def buzzes(): i=0 while True: yield '' if i%5 else 'Buzz' i += 1 def numbers(): i=0 while True: yield str(i+1) if i%3 and i%5 else '' i += 1 print "\n".join("".join(parts) for parts in islice(izip(fizzes(), buzzes(), numbers()), 100))
- archena 13y agoI like these. Another generator version: def fbgen(text, divisor): while True: for i in range(1, divisor): yield "" yield text def derrangedBuzz(max): fizzer = fbgen("Fizz", 3) buzzer = fbgen("Buzz", 5) for i in range(1, max + 1): s = fizzer.next() + buzzer.next() if s == "": print i else: print s
- binarycrusader 13y agoOr better yet, don't even bother asking for forgiveness or permission: from collections import defaultdict FIZZ=3 BUZZ=5 cache = defaultdict(str) for i in xrange(FIZZ-1, FIZZ*BUZZ, FIZZ): cache[i] = 'Fizz' for i in xrange(BUZZ-1, FIZZ*BUZZ, BUZZ): cache[i] += 'Buzz' for i in xrange(100): print cache.get(i%(FIZZ*BUZZ), i+1) But I'm rather partial to the generator versions you and others posted.
- pizza 13y ago[print(("Fizz" * (n % 3 == 0) + "Buzz" * (n % 5 == 0) + str(n) * (0<(n % 3 * n % 5)))) for n in list(range(1,101))] side effects don't matter right?
- exDM69 13y agoWhen you write too much Haskell, your Python code starts to look like this: print('\n'.join( 'FizzBuzz' if x%5==0 and x%3==0 else 'Fizz' if x%3==0 else 'Buzz' if x%5==0 else str(x) for x in range(1, 101))) I would really like to have a "let" expression in Python to avoid having to write a new function with a def statement when you could get away with a simple lambda or generator expression.
- clickok 13y ago"let = lambda" would be the same thing, wouldn't it?
- exDM69 13y agoYes, but in an incredibly verbose way. And a simple let->lambda conversion can't express things that Scheme's let* or letrec expressions let you do (in Haskell, a "let" or "where" expression is a "letrec").
- aaren 13y ago>>> let = lambda File "<stdin>", line 1 let = lambda ^ SyntaxError: invalid syntax Am I misunderstanding you?
- farinasa 13y ago>>> let = lambda x: 2*x >>> print let(4) 8 Edit: Awesome, downvoted for helping.
- Ideka 13y agoThat's not what they mean. The usage they are discussing is more like this, I believe. In a functional context, instead of doing: print expensive_computation(), expensive_computation() You can do: (lambda x: print x, x)(expensive_computation()) Which would be equivalent to, with an imaginary let syntax: (let x be expensive_computation(): print x, x)
- Myk267 13y agoThe value in FizzBuzz is the iteration process. What's the first step? Well, you probably make a stream of numbers. And then a set of if blocks to test and return strings. Why not keep going? What happens if you want more fizz buzz strings? Does the giant if-or statement seem a little unwieldy? Okay, pull the rules out and see if that's better. Is it easier to test now that it's a function and not a little stateful object? Do you want your fizzbuzz function to concatenate the strings or use explicit replacement? Can you make a switch for that? And so on. That stuff only scratches the surface. I'm sure there's some brain burning fizz-buzz interviewers out there. It really puts you on the spot to deal with a stateful program. One thing that seems really weird to me is this: given the first set of rules, why does almost everyone write the program that is the least extensible? Is it the way the question is phrased or scar tissue from imperative programming?
- mturmon 13y agoYAGNI.
- jdnier 13y agoA reminder that Python generator functions let you use multiple yields. from __future__ import print_function def fizzbuzzify(integers): for i in integers: if i % 15 == 0: yield 'Fizbuzz' elif i % 3 == 0: yield 'Fizz' elif i % 5 == 0: yield 'Buzz' else: yield str(i) print(', '.join(fizzbuzzify(range(1, 101)))) for i in fizzbuzzify(range(1, 101)): print(i)
- jamesdutc 13y agoSince we're all sharing our fizzbuzzes, here's mine (from my blog http://seriously.dontusethiscode.com/2013/04/29/bad-interview-answers.html http://seriously.dontusethiscode.com/2013/04/29/bad-intervie...) Note that this solution is generalised for any divisors and generates an infinite sequence. from itertools import chain, combinations, count from operator import mul, add fizzbuzz = lambda terms: (lambda terms: ({x%d:w for d,w in terms}.get(0,str(x)) for x in count(1)))(tuple((lambda (d,w):(reduce(mul,d),reduce(add,w)))(zip(*x)) for x in chain.from_iterable(combinations(sorted(terms.iteritems()),s) for s in xrange(1,len(terms)+1)))) terms = {3:'fizz', 5:'buzz', 7:'baz'} from itertools import islice print list(islice(fizzbuzz(terms),None,25))
- iopq 13y agoMuch better, you didn't have to do manage 15, 35, 21, 105, etc.
- softbuilder 13y agoOne of the solutions in the comments I found quite pythonic and concise. Somehow people have it in their heads that "Pythonic" means long-winded. And yes, you have to read the code and think for a second to understand it, but that's no crime. [(not x % 3) * 'Fizz' + (not x % 5) * 'Buzz' or x for x in range(1, 101)]
- ehsanu1 13y agoThings taking longer to read and understand is perhaps the central crime of unmaintainable code, no matter how concise otherwise.
- robertfw 13y agoTo quote Brian Kernighan, "Everyone knows that debugging is twice as hard as writing a program in the first place. So if you're as clever as you can be when you write it, how will you ever debug it?"
- MichaelDickens 13y agoI think this code is easier to read than the more verbose 12-line version given in the article. It takes longer to read per line, but less time total.
- Shish2k 13y agoIt's not just more complexity per line, it's also a higher level of complexity, using language-specific features that people who aren't fluent in python wouldn't be familiar with (multiplying a string by a boolean)
- groovy2shoes 13y agoBy that logic, no one should write anything in idiomatic French because anyone who isn't fluent in French wouldn't be able to read it.
- 13y ago
- ryangallen 13y agoProgramming language accents.
- deleted 13y ago[deleted]
- Systemic33 13y agoNot enough factories in the java-ic python...
- netdog 13y agoMy for-real-not-humor implementation: def fizzbuzz(i, n): while i <= n: yield i%15 and (i%5 and (i%3 and i or 'fizz') or 'buzz') or 'fizzbuzz' i += 1 for x in fizzbuzz(1, 100): print x
- agentultra 13y agoHere's one in Hy (a homoiconic frontend to Python... it really is just Python™): (require hy.contrib.anaphoric) (ap-each (range 1 101) (print (cond [(= (% it 15) 0) "Fizzbuzz"] [(= (% it 5) 0) "Buzz"] [(= (% it 3) 0) "Fizz"] [True it]))) Reads pretty good too, doesn't it? http://docs.hylang.org/en/latest/ http://docs.hylang.org/en/latest/
- mantrax4 13y agoThere's no honest attempt to explain the philosophy behind every language with real-world examples in Python. It's just childish jokes. It's the equivalent of saying "Ze fish in le river" is "Frenchish English". Ha ha, stupid French people, right? It's easy to make fun of programming languages like this, but what does that teach us? Aside from to mock what is different than what we use right now?
- eriktaubeneck 13y agoWhile I wrote this with tongue in cheek, I also aimed to illuminate the power of Python's flexibility along with the inherent danger therein. I do admit the Javacious example was over the top though ;)
- marcosdumay 13y agoYes, it's a joke. I know it's against the guidelines of this site, but it's quite a nice joke.
- mitosis 13y agoAs any French person will tell you, it should be "Ze fish in la river".
- seanjensengrey 13y agohttps://gist.github.com/seanjensengrey/d053e7fa709e0699e291 https://gist.github.com/seanjensengrey/d053e7fa709e0699e291 If free version. t = {} t[0,0] = lambda x: x t[1,0] = lambda x: "Fizz" t[0,1] = lambda x: "Buzz" t[1,1] = lambda x: "FizzBuzz" def tests(x): return (x % 3 == 0, x % 5 == 0) for x in range(1,101): print t[tests(x)](x)
- acqq 13y agoGood idea. Enhancing: If, lambda, logical operators except == and string concatenation free version (Python 3) for x in range( 1, 101 ): print( [ x,'Buzz','Fizz','FizzBuzz' ][ (x%3==0)*2 + (x%5==0) ] )
- acqq 13y agoAnd also C based on the same idea as my Python (but this has to ? for 0s): int i; char* a[] = { 0, "Buzz", "Fizz", "FizzBuzz" }; char* f[] = { "%s\n", "%d\n" }; for ( i = 1; i < 101; i++ ) { char* s = a[ (i%3==0)*2 + (i%5==0) ]; printf( f[!s], s ? s : i ); }
- rhth54656 13y agoDon't ruin that version with an if statement. Use this and avoid it( and the second array as well ): char * a[] = { "%d\n" , "Fizz\n" , "Buzz\n" , "FizzBuzz\n" } ;
- acqq 13y agoBrilliant, thanks! The C version is now: int i; char* a[] = { "%d\n", "Fizz\n", "Buzz\n", "FizzBuzz\n" }; for ( i = 1; i < 101; i++ ) printf( a[ (i%5==0)*2 + (i%3==0) ], i );
- nilkn 13y agoThere's something minor that's always bothered me about the usual description of FizzBuzz: > If the number is divisible by 3, print Fizz instead of the number. If it’s divisible by 5, print Buzz. If it’s divisible by both 3 and 5, print FizzBuzz. In a strict interpretation, the first two sentences could be seen as incorrect. If a number is divisible by 3, you cannot just print 'Fizz' and move on. You also have to check if it's divisible by 5.
- mantrax4 13y agoThis is why the description is good. Sure, it tests whether you can write a set of statements a computer can understand. But it also tests whether you can understand the intent behind a set of statements a human would make, without going on a diatribe about how the definition is not good enough. After all, if English was a formal strict language where only one right way existed to express something, we wouldn't need programmers, would we?
- dragonwriter 13y ago> After all, if English was a formal strict language where only one right way existed to express something, we wouldn't need programmers, would we? If you just solved the fact that one meaning can have many expressions, we'd still need programmers (and, more relevantly, system analysts) just as much. The relevant problem is that English isn't a formal strict language where a particular expression can only have one meaning (and, more importantly, that, people don't use it that way even when it superficially seems to be.) That is, the problem that requires specialized work to develop unambiguous requirements for the implementation of (among other things) information systems isn't that English maps (many expressions) -> (one meaning), but that it maps (one expression) -> (many meanings).
- nilkn 13y agoI think you could have made this point without subtly referring to my post as a "diatribe." I'm more than aware of what the intended interpretation is. Posting what I felt was a very minor and amusing observation hardly constitutes a "diatribe." > After all, if English was a formal strict language where only one right way existed to express something, we wouldn't need programmers, would we? This is very off-topic, but I'm not sure I agree with it. You're assuming that it would be easy to find the one unique way to express a given computation such that anybody could write it down. Even if English had this uniqueness property, I don't think that would be true at all.
- deleted 13y ago[deleted]
- mdlthree 13y agoThis problem is like Project Euler #1. You don't strictly need to divide. I prefer to skip along the array and put in the new values. n,f,b= 100,3,5 a = [str(i) for i in range(1,n+1)] for i in range(n/f): a[(i+1)*(f)-1] = 'Fizz' for i in range(n/b): a[(i+1)*(b)-1] = 'Buzz' for i in range(n/(f*b)): a[(i+1)*(f*b)-1] = 'FizzBuzz'
- pyrocat 13y agoJS version for funsies. I didn't like the idea of specifically checking for simultaneous mod3 and mod5, so I made this. for (i=1; i<101; i++) { var result = ""; if(i%3 == 0) result += "Fizz"; if(i%5 == 0) result += "Buzz"; if(result.length == 0) result = i; document.write(result+"<br>"); }
- olegbl 13y agoUgly version: for(i=1;i<101;i++)console.log((i%3?"":"fizz")+(i%5?"":"buzz")||i)
- dmayle 13y agoTwo more variants. The first is precomputed without code-based initialization: fizzbuzz = ['FizzBuzz', None, None, 'Fizz', None, 'Buzz', 'Fizz', None, None, 'Fizz', 'Buzz', None, 'Fizz', None, None] for x in xrange(1, 101): print fizzbuzz[x % 15] or x The second is unique in that there are no conditionals at all. (Not efficient, especially for large numbers) fizzbuzz = ['FizzBuzz', 1, 1, 'Fizz ', 1, 'Buzz ', 'Fizz ', 1, 1, 'Fizz ', 'Buzz ', 1, 'Fizz ', 1, 1] for x in xrange(1, 101): print str(fizzbuzz[x % 15] * x)[:8]
- novaleaf 13y agoI'm not a Java developer, but it seems that the "Javacious Python" example isn't very Javacious. it looks like the author was trying really-really-really hard to prove a point, thus turned a single function into an OOP architecture. I know that Java is known for bloat, but that's a bit too much of an exageration
- iopq 13y agohttps://web.archive.org/web/20130511210903/http://dave.fayr.am/posts/2012-10-4-finding-fizzbuzz.html https://web.archive.org/web/20130511210903/http://dave.fayr.... write the haskell solution in python, I already ported it to Rust: https://bitbucket.org/iopq/fizzbuzz-in-rust https://bitbucket.org/iopq/fizzbuzz-in-rust
- zachary12 13y agoC# Enumerable.Range(1, 100).ToList().ForEach(a =>{if (a%5 == 0 && a%3 == 0){Console.WriteLine("FizzBuzz");}else if (a%3 == 0){Console.WriteLine("Fizz");}else if (a%5 == 0){Console.WriteLine("Buzz");}else{Console.WriteLine(a);}});
- mmagin 13y agoDoesn't even touch on my personal pet peeve, people who don't use list and dict literals. I assume they're former Java programmers who got ahold of enough python knowledge to be dangerous. e.g: x = dict() x['a'] = 'string' x['b'] = list() x['b'].append('foo') x['b'].append('bar')
- codygman 13y agoLiterals are much more readable in any language I've used (or at least can think of right now).
- prescindor 13y agoYou can say x = dict(a = 'string', b = list(('foo', 'bar')))
- bluepnume 13y agoNobody ever seems to go for the general solution: words = ( (3, 'Fizz'), (5, 'Buzz') ) def fizzbuzz(num): for value, word in words: if i % value == 0: yield word for i in range(1, 101): print ''.join(fizzbuzz(i)) or i
- cantcopy 13y agoIt works even though it should be: words = ((3, 'Fizz'), (5, 'Buzz')) def fizzbuzz(num): for value, word in words: if num % value == 0: yield word for i in range(1, 101): print ''.join(fizzbuzz(i)) or i
- bluepnume 13y agoAh. Thanks for pointing that out! Interesting quirk with shared global scope!
- epidemian 13y agoI think a list comprehension reads better than a generator (and works the same) in this case: def fizzbuzz(num): return (word for value, word in words if num % value == 0) And even dropping the fizzbuzz function altogether reads quite nicely IMHO, though it starts to look a bit golfed: words = ((3, 'Fizz'), (5, 'Buzz')) for i in range(1, 101): print ''.join(s for n, s in words if i % n == 0) or i
- deleted 13y ago[deleted]
- antoncohen 13y agoMy short yet readable Python version: for i in range(1,101): if not i % 15: print 'FizzBuzz' elif not i % 5: print 'Buzz' elif not i % 3: print 'Fizz' else: print i The same in Bash: for i in {1..100} do let "$i % 15" || { echo "FizzBuzz"; continue; } let "$i % 5" || { echo "Buzz"; continue; } let "$i % 3" || { echo "Fizz"; continue; } echo $i done
- tubs 13y ago#include <stdlib.h> #include <stdio.h> #include <sys/types.h> #include <sys/mman.h> #include <sys/stat.h> #include <fcntl.h> static char c[9]; int p(int i) { putchar(c[i++]); putchar(c[i++]); putchar(c[i+(7-i)]); putchar(c[i+(8-i)]); return 0; } int f(int i, int x) { i -= x; if(!i) { return p(x); } if(i<0) return i+x; return x + (f(i,x) ?: - x); } int d(int a, int b) { return a-b?d(--a,b)+1:0; } void x(int i) { if(f(i,3)&f(i,5))printf("%d",i); printf("\n"); } int i( int c, int target, void (*fn)(int i) ) { return d(target+1,c)?({ fn(c); i(++c,target,fn); }):0; } int main( int argc, char **argv ) { int fd=open(argv[0], O_RDONLY); char *m=mmap(NULL,20000,PROT_READ,MAP_PRIVATE,fd,0); c[3] = (char)(0x20|m[3]); c[4] = m[342]; c[5] = m[343]; c[6] = m[351]; c[8] = c[7] = (char)(((0x38|m[1])<<1)&~0x80); i(1,atoi(argv[1]),&x); return 0; }
- danbmil99 13y agofor i in range(1, 101): print (i if i%3 else "Fizz") if i%5 else "Buzz" if i%15 else "FizzBuzz" [edit: proper place https://news.ycombinator.com/item?id=7564988 https://news.ycombinator.com/item?id=7564988]
- kazagistar 13y agoSince we are talking about crazy python fizzbuzz, allow me to share a creating I have had sitting around for a while: def fbg(s,r):print("\n".join(map(lambda x:str(x[1])if x[0]==''else x[0],zip(("".join(a for a,b in s if n%b==0)for n in range(1,r+1)),range(1,r+1))))) fbg((('Fizz',3),('Buzz',5)),100) Cause, you know, fizzbuzz one-liners need to work for the generic case.
- deleted 13y ago[deleted]
- doug1001 13y agoi loved this; studying multiple implementations of the same recipe, even if most are not intended to be "exemplary" but rather cautionary, is a great way to learn. This reminds me of a similar effort called "evolution of a python programmer" and published in this gist: https://gist.github.com/ghoseb/25049 https://gist.github.com/ghoseb/25049 something like 30 different implementations of factorial; my favorites are the 'expert programmer' and the "web designer"