this post was submitted on 12 Apr 2025
193 points (90.0% liked)

Technology

68672 readers
3787 users here now

This is a most excellent place for technology news and articles.

Our Rules

  1. Follow the lemmy.world rules.
  2. Only tech related news or articles.
  3. Be excellent to each other!
  4. Mod approved content bots can post up to 10 articles per day.
  5. Threads asking for personal tech support may be deleted.
  6. Politics threads may be removed.
  7. No memes allowed as posts, OK to post as comments.
  8. Only approved bots from the list below, this includes using AI responses and summaries. To ask if your bot can be added please contact a mod.
  9. Check for duplicates before posting, duplicates may be removed
  10. Accounts 7 days and younger will have their posts automatically removed.

Approved Bots

founded 2 years ago
MODERATORS
L3s@lemmy.world
enu@lemmy.world
technopagan@lemmy.world
L4s@lemmy.world
L3s@hackingne.ws
L4s@hackingne.ws
193
Python Performance: Why 'if not list' is 2x Faster Than Using len() (blog.codingconfessions.com)
submitted 1 day ago by abhi9u@lemmy.world to c/technology@lemmy.world
148 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[–] uis@lemm.ee -3 points 1 day ago* (last edited 1 day ago)
  1. Performance is often more tied to the code than to the interpreter - an O(n³) algorithm in blazing fast C won't necessarily perform any better than an O(nlogn) algorithm in Python.

An O(n³) algorithm in Python won't necessarily perform any better than an O(nlogn) algorithm in C. Ever heard of galactic algorithms?

The overhead my classmates had dealing with poorly optimised code that caused constant cache misses was far greater than the interpreter overhead in my code (though at the time I don't think I could have explained why their code was so slow compared to mine).

Did they write naive linear algebra operators?