I found this line of code on SoloLearn.com in the python lessons recursion comments, this does a math computation of factorial parameter you call it with. Thing about it that really stands out to me is how compact this is and it’s recursion. Recursion gets a bad rap due to being a bit more memory intensive, but I still love this.
# Amazing factorial lambda recursion found on SoloLearn. Things used in this small code are objects, lambda, ternary, and of course recursion. fact = lambda x: 1 if x == 1 else x * fact(x - 1) print(fact(5)) # Prints out: 120 # Factorial and how it works below. # fact(5) = 120 # 1 * 2 * 3 * 4 * 5
I think it’s sexy AF.