436
Marge sort (lemmy.ml)
you are viewing a single comment's thread
view the rest of the comments
[-] skibidi@lemmy.world 10 points 2 days ago

Note: N^2 and NlogN scaling refer to runtime when considering values of N approaching infinity.

For finite N, it is entirely possible for algorithms with worse scaling behavior to complete faster.

this post was submitted on 07 May 2025
436 points (97.8% liked)

Programmer Humor

23147 readers
1027 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

founded 2 years ago
MODERATORS