this post was submitted on 22 Dec 2023
31 points (91.9% liked)

Programming

17344 readers
405 users here now

Welcome to the main community in programming.dev! Feel free to post anything relating to programming here!

Cross posting is strongly encouraged in the instance. If you feel your post or another person's post makes sense in another community cross post into it.

Hope you enjoy the instance!

Rules

Rules

  • Follow the programming.dev instance rules
  • Keep content related to programming in some way
  • If you're posting long videos try to add in some form of tldr for those who don't want to watch videos

Wormhole

Follow the wormhole through a path of communities !webdev@programming.dev



founded 1 year ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
[โ€“] hallettj@beehaw.org 4 points 10 months ago (1 children)

I pretty much always use list/iterator combinators (map, filter, flat_map, reduce), or recursion. I guess the choice is whether it is convenient to model the problem as an iterator. I think both options are safer than for loops because you avoid mutable variables.

In nearly every case the performance difference between the strategies doesn't matter. If it does matter you can always change it once you've identified your bottlenecks through profiling. But if your language implements optimizations like tail call elimination to avoid stack build-up, or stream fusion / lazy iterators then you might not see performance benefits from a for loop anyway.

[โ€“] blindsight@beehaw.org 1 points 10 months ago* (last edited 10 months ago)

Yes. I know some of those words.

Seriously, though, I'm not a programmer, but I picked up enough from context cues and background information that I think I got most of the big ideas. It's fun to read about computer science.

I wonder where my life would have gone if I'd made a different career choice, away from CS.