383

Who cares about time complexity (lemmy.world)

submitted 1 day ago by qaz@lemmy.world to c/programmer_humor@programming.dev

57 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[-] lugal@lemmy.dbzer0.com 16 points 21 hours ago

True. Lost opportunity to blow things up with useless recursivity

[-] bleistift2@sopuli.xyz 15 points 20 hours ago

The word you’re looking for is recursion (see recursion).

[-] lugal@lemmy.dbzer0.com 5 points 11 hours ago

Thanks. I knew something was off

[-] Gonzako@lemmy.world 5 points 18 hours ago

Nah, I'd like to un-see recursion. It was way overblown on uni, I barely ever use it.

[-] Cethin@lemmy.zip 9 points 13 hours ago

Recursion is amazing for a small selection of problems. Most of the time you don't need, or want, it. When it is useful though, it tends to be really useful.

I don't understand people's issue with it. I always found it easy. Maybe that's why I feel this way. Maybe if you find it challenging you want to avoid it, even when it's a good solution.

[-] kamstrup@programming.dev 3 points 9 hours ago

Most devs I know like recursion. Trouble is that many popular languages don't support tail recursion, but throw a stackoverflow error after a few thousand levels. So you have to keep track of max recursion depth manually, and it starts to look like a complicated solution

[-] Ephera@lemmy.ml 4 points 11 hours ago

I think, their point (and also my experience) is that you get taught about it in university a lot more than about simple loops, so it feels more important even though you rarely use it in reality.

Same thing goes for linked lists and inheritance...