0xc0der

5 ms·

1. 1.▲
   by 0xc0der 2y ago

   > Your solution is not an exact solution to the knapsack problem, but a (relatively well known) greedy heuristic approach towards the problem. can point me to where to find more about this. > For a counterexample, imagine you have a t
2. 2.▲
   by 0xc0der 2y ago

   I have been recently thinking about the NP-complete class of problems particularly the knapsack problem (it is easy to understand and attack). And I think it is really solvable in polynomial time. I actually tried and posted my solution her
3. 3.▲
   Attacking the knapsack problem(dev.to)

   1 points by 0xc0der 2y ago|0 comments
4. 4.▲
   by 0xc0der 2y ago

   you are stuck; over analyzing your life. I mean it's not bad to be self aware of what is wrong with you. but the point is "what's next?". yes you know all this about yourself. what are you going to do do about it? don&#x
5. 5.▲
   Show HN: Xuijs is A JavaScript library for creating reactive user interfaces(github.com)

   2 points by 0xc0der 2y ago|0 comments
6. 6.▲
   Functions and inverses with 2 insightful examples(dev.to)

   1 points by 0xc0der 2y ago|0 comments
7. 7.▲
   A simple JSON parser using pari(github.com)

   3 points by 0xc0der 2y ago|0 comments
8. 8.▲
   Pari: More than a simple parser combinator(github.com)

   2 points by 0xc0der 2y ago|0 comments