aeon10

There seems to be ALOT of 'Git Explained' stuff. The best way to learn Git in my opinion is start using it! Google stuff as you go.

quick tip : google.com/ncr for no country redirect.

can you please explain how this works?

It is awfully difficult to get a technical TL;DR version from a website, whose target audience is programmers. I think explaining what this does concisely and technically, preferably on the front page with code examples etc would be really useful.

Can someone please explain to me in short what this does?

the cycle, article about some thing -> post implementing it on HN is pretty damn awesome. I remember reading articles about this a few days back and here we have this. I remember reading articles about Await in JS and a link to a framework doing exactly that was posted a few days later.

Brilliant. I wish you guys the best of luck. I hope all of this pays off in the end and you guys can make this awesome product profitable, because I hope to be using this for a long time :)

from what I've seen this is all free. which is ofcourse great. and open source too. But I wonder if you guys have a business model? I mean somebody has to pay for those servers right?

There is also a lot of talk about Docker and Vagrant working together. Like using Vagrant to manage Docker containers..

I really love the infinite scrolling. I think there should be a bit more contrast. It is hard to read the light colored orange on white. Also the visited (light light orange) is a pain. And maybe highlighting the points a thread has would be a nice feature too. Maybe another darker color for that.

only the slides? audio or maybe a video available?

I'm not quite sure what the resource here is? Lecture notes and syllabus overview? No lecture videos? so how is this useful for the rest of us who are not in Princeton. what am i missing here.

how about we make this regular. monthly or something. I cant make it in April but definitely next month and I'd love to meet more like minded people and hang out at least once a month.

what is the font used in the example gifs

do you happen to have a blog about this stuff? I'd love to read it

These are amazing lectures. Clean slides with no distractions. to the point explanations by someone clearly very knowledgeable. Makes the lectures even more better. Really helpful videos.

I think this is a really good response from Instacart. Heroku could learn a few things from them I suppose. But again, good response from the Instacart team. well done.

I thought a hash being relatively slower makes it better.

Because then it would take more time to brute force. I mean if hashes were near instant then even without any theocratical collision that wouldn't be good, that hash would fall faster than a slower one!

view-source would still work right. so

No.. should I be worried? What exactly happened to your account and are you certain it had something to do with the article? (that website)

I'd like to know too. This is an absolutely amazing tool, functional and built beautifully.

Is this the same vlad from vladstudio.com ? I always loved his work there. probably not considering vladstudio.com is more about photoshop designs and not about web development.

A beautifully designed page more than anything else

I forked your code, added support so you can do (C-N) to open a new tab, click tab and start typing (the cursor will be at the end of the line), polished it up a bit (changed font to consolas, added a grey background with a tint of white text-shadow). I've sent a pull request.

https://github.com/AeonAxan/textpad

Just a note, In the iterative solution, by changing the i (loop variable) from an int to an long int the times by both iterative and recursive are almost equal. Here are the new results

[Recursive - 7921 ms], [Iteratiive - 8078 ms]

So the difference is negligible.

Yes, I understand that recursion is much more appealing and leads to much cleaner and elegant code than iterative solutions. and thank you for the introduction to the community I suppose.

Anyway I forked the original code, added an iterative version based on the comment by (Nick Craig Wood) (https://github.com/AeonAxan/benchmarking_fibonacci)

Here are the benchmarks [recursive fib: 7,765 ms] | [iterative fib: 8,047 ms] | [analytic opt fib: 54,875] | [analytic fib: 103,937 ms] |

And it appears that the recursive version is faster than the naive iterative version by a few hundred milliseconds.

If im not mistaken the iterative solution of using a simple for loop would definitely be insanely faster than a recursive algorithm which is exponential.. What am i missing here?