Learn Programming

1648 readers

1 users here now

Posting Etiquette

Ask the main part of your question in the title. This should be concise but informative.
Provide everything up front. Don't make people fish for more details in the comments. Provide background information and examples.
Be present for follow up questions. Don't ask for help and run away. Stick around to answer questions and provide more details.
Ask about the problem you're trying to solve. Don't focus too much on debugging your exact solution, as you may be going down the wrong path. Include as much information as you can about what you ultimately are trying to achieve. See more on this here: https://xyproblem.info/

Icon base by Delapouite under CC BY 3.0 with modifications to add a gradient

founded 1 year ago

MODERATORS

Ategon

JaumeI

bugsmith

How do I learn to optimize my code better? (lemmy.ml)

submitted 5 months ago by [email protected] to c/learn_programming

19 comments fedilink hide all child comments

I'm trying to make minesweeper using rust and bevy, but it feels that my code is bloated (a lot of for loops, segments that seem to be repeating themselves, etc.)

When I look at other people's code, they are using functions that I don't really understand (map, zip, etc.) that seem to make their code faster and cleaner.

I know that I should look up the functions that I don't understand, but I was wondering where you would learn stuff like that in the first place. I want to learn how to find functions that would be useful for optimizing my code.

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

[–] [email protected] 7 points 5 months ago (2 children)

but unless your computations are sluggish and repeat a lot of unnecessary steps

In other words, the kind of optimizing that's worth it is choosing a better algorithm to reduce its big-O complexity class.

[–] Akrenion 4 points 5 months ago

I was thinking about caches and evaluating what calculations I want to do.

I fixed a project for someone simulating a machine. That took them almost 9 minutes. Simply replacing the part where they initialised a solver and used it to find a zeropoint of a quadratic function with a call to that initialiser got it down to a minute.

You should have seen their faces when we put the quadratic formula in and it took 28 seconds.

[–] balder1993 3 points 5 months ago* (last edited 5 months ago)

The mental model I have about performance is that the higher abstraction usually beats the lower level abstraction.

So in that sense, a well architected software with proper caching, multithreading where it matters etc. will beat badly architected software (ex: one that brute forces everything). Then, that being equal, good algorithms and solutions beat bad ones. Only then faster runtimes make more of a difference, and at the bottom things like more efficient processor architectures, more efficient compiler etc. beat slower ones.

A good example is Lemmy itself, which as far as I know was made in Rust to be super fast, but then at the beginning was being DDOSed quite easily because of the way the database was designed and lots of queries were very slow. Once they fixed that, Lemmy became actually usable.