andrewp123

6 ms·

31.
by andrewp123 3y ago
In my opinion space limited solutions are not very interesting. Time complexity is always >= space complexity, so finding optimal time solutions is always more interesting. And we already knew the optimal time complexity. I appreciate a
32.
by andrewp123 3y ago
It would be funny if one of the arrows in the visual on the side were missing. “Sorry, you can’t convert that.”
33.
by andrewp123 3y ago
It seems their result has been out for almost a year now... https://arxiv.org/abs/2303.14605 I'm curious how this affects Traveling Salesman. I was under the impression that all NP-Complete problems take O(n!). Do
34.
by andrewp123 3y ago
Very confusing to call it time travel when it has nothing to do with time…
35.
by andrewp123 3y ago
This post really doesn’t say a lot. One sentence describes it: if people are incentivized to move towards each other they will, and if they’re not as much then they won’t. This is a common practice I see among educators, make something over
36.
by andrewp123 3y ago
Not this again.
37.
by andrewp123 3y ago
Drastically edited from last time. Let me know what you think.
38.
by andrewp123 3y ago
The article explicitly states that sorting is O(n log n), giving rise to log n per element. I think you missed that I'm talking about adding/removing/reading a single element at a time.
39.
There are only 3 data structures(deriveit.org)
6 points by andrewp123 3y ago|3 comments
40.
by andrewp123 3y ago
I'm not sure if this is very obvious or very interesting. Let me know what you think (I wrote the article).
41.
by andrewp123 3y ago
How is the average Jewish Mean Nationwide SAT score n/a? I would have liked to see that...