Anonymous
7/14/2025, 3:12:47 AM No.105897678
>O(n2)
Replies:
Thread 105897678 - /g/ [Archived: 352 hours ago]
Anonymous
7/14/2025, 3:27:02 AM No.105897808
>Don't care about algorithm complexity. Write the most inefficient code and deploy it to production as long as it works.
Anonymous
7/14/2025, 7:43:51 AM No.105899586
>he doesn't know about main memory access time
Replies:
Anonymous
7/14/2025, 10:22:26 AM No.105900550
Anonymous
7/14/2025, 12:04:32 PM No.105901192
>>105899876
Explain synthax, einstein
Explain synthax, einstein
Anonymous
7/14/2025, 2:36:23 PM No.105902212
>>105899586
The big O notation is used for both space and time complexity. Main memory access times are also almost irrelevant for algorithms. Either the data fits into smaller caches, or it doesn't and the memory data rate becomes the limiting factor. If your algorithm has to stop to wait for the main memory all the time you're usually doing something wrong.
The big O notation is used for both space and time complexity. Main memory access times are also almost irrelevant for algorithms. Either the data fits into smaller caches, or it doesn't and the memory data rate becomes the limiting factor. If your algorithm has to stop to wait for the main memory all the time you're usually doing something wrong.
Replies:
Anonymous
7/14/2025, 2:39:13 PM No.105902224
>>105902212
>having data that doesn't fit in a few megabytes of cache is wrong
Please KYS, and ideally your entire family too (so they can't have another one like you).
>having data that doesn't fit in a few megabytes of cache is wrong
Please KYS, and ideally your entire family too (so they can't have another one like you).
Anonymous
7/14/2025, 2:40:32 PM No.105902230