Maybe consider a different color palette. I have a red/green color blindness (like ~8% of the male population), and I can only barely differentiate the colors.
I wouldn't call some cases of UB like overflowing a signed int or running into a dangling reference "actively pushing the compiler". I'm having a hard time believing you didn't ever run into these or similar issues…
> I don't believe that it does. If the invalid arithmetic proceeds without crashing, and produces a value in the int32_t i variable, then that issue is settled. The subsequent statement should behave according to…
As others are pointing out, the C standard does allow this. There is no safe way to check for undefined behavior (UB) after it has happened, because the whole program is immediately invalidated. This has caused a Linux…
Algorithm fib1 („Dynamic Programming without Memoization“) is just ordinary recursion and not dynamic programming.
It is hard to overestimate the importance of the OEIS in enumerative combinatorics. I discovered the main results of my PhD thesis essentially as follows: 1. Find complicated construction A, hoping to prove some new…
This problem is called Chinese Postman Problem and can be solved in polynomial time using matching algorithms: https://en.m.wikipedia.org/wiki/Route_inspection_problem
Maybe consider a different color palette. I have a red/green color blindness (like ~8% of the male population), and I can only barely differentiate the colors.
I wouldn't call some cases of UB like overflowing a signed int or running into a dangling reference "actively pushing the compiler". I'm having a hard time believing you didn't ever run into these or similar issues…
> I don't believe that it does. If the invalid arithmetic proceeds without crashing, and produces a value in the int32_t i variable, then that issue is settled. The subsequent statement should behave according to…
As others are pointing out, the C standard does allow this. There is no safe way to check for undefined behavior (UB) after it has happened, because the whole program is immediately invalidated. This has caused a Linux…
Algorithm fib1 („Dynamic Programming without Memoization“) is just ordinary recursion and not dynamic programming.
It is hard to overestimate the importance of the OEIS in enumerative combinatorics. I discovered the main results of my PhD thesis essentially as follows: 1. Find complicated construction A, hoping to prove some new…
This problem is called Chinese Postman Problem and can be solved in polynomial time using matching algorithms: https://en.m.wikipedia.org/wiki/Route_inspection_problem