Advent Of Code

770 readers

1 users here now

An unofficial home for the advent of code community on programming.dev!

Advent of Code is an annual Advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like.

AoC 2023

Solution Threads

M	T	W	T	F	S	S
				1	2	3
4	5	6	7	8	9	10
11	12	13	14	15	16	17
18	19	20	21	22	23	24
25

Rules/Guidelines

Follow the programming.dev instance rules
Keep all content related to advent of code in some way
If what youre posting relates to a day, put in brackets the year and then day number in front of the post title (e.g. [2023 Day 10])
When an event is running, keep solutions in the solution megathread to avoid the community getting spammed with posts

Relevant Communities

Relevant Links

Advent of Code Homepage

Credits

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

console.log('Hello World')

founded 1 year ago

MODERATORS

Ategon

[email protected]

CameronDev

Measuring performance in a hardware-agnostic way (lemmy.blahaj.zone)

submitted 11 months ago by [email protected] to c/advent_of_code

12 comments fedilink hide all child comments

Is there a way to measure performance without depending on the hardware, i.e. two entirely different computers get the same score for the same code?

I could probably run the program on a server or something, but something local feels more reliable.

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

[–] [email protected] 2 points 11 months ago (1 children)

Sure, but that makes a lot of optimizations nonexistent (e.g. cloning the input on an O(n) algorithm is "free")

[–] damium 4 points 11 months ago

You don't need to use big-O. You can calculate the full complexity in algebraic notation. It's just a lot more work as you don't get to discard terms.