gk101

3 ms·

1. 1.▲
   Why power brings out your true self(nautil.us)

   2 points by gk101 10y ago|0 comments
2. 2.▲
   by gk101 10y ago

   [(1, 2, 3), (2, 4, 5)] would result in a graph like this: 1 - 2 - 3 \ 4 - 5 Building the (undirected) graph would take linear time, and once it is built, you can do a simple Depth First Search to mark all the connected comp
3. 3.▲
   by gk101 10y ago

   Yes, however big O notation isn't about which programs run faster, it's about how the runtime of a program changes in response to the input size
4. 4.▲
   by gk101 10y ago

   A few comments just in case this a critical part of your program, and if running it faster would help: 1. Using a heap with Dijkstra's algorithm would speed up your program From your comment I am guessing you are using Dijkstra's
5. 5.▲
   Is China’s gaokao the world’s toughest school exam?(theguardian.com)

   2 points by gk101 10y ago|0 comments
6. 6.▲
   by gk101 10y ago

   In fact he has a course on edx for this: https://www.edx.org/course/street-fighting-math-mitx-6-sfmx
7. 7.▲
   by gk101 11y ago

   Yup it's the same dude that ripped it off
8. 8.▲
   The Emotions That Make Us More Creative(hbr.org)

   42 points by gk101 11y ago|5 comments
9. 9.▲
   by gk101 12y ago

   The author gave a TED talk about this here: https://www.youtube.com/watch?v=Qy5A8dVYU3k and yes, the default mode of the mind is to wander: http://en.wikipedia.org/wiki/Default_mode_network