aeon10

8 ms·

61.
by aeon10 14y ago
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 faste
62.
by aeon10 14y ago
view-source would still work right. so
63.
by aeon10 14y ago
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)
64.
by aeon10 14y ago
I'd like to know too. This is an absolutely amazing tool, functional and built beautifully.
65.
by aeon10 14y ago
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.
66.
by aeon10 14y ago
A beautifully designed page more than anything else
67.
by aeon10 14y ago
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 te
68.
by aeon10 14y ago
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
69.
by aeon10 14y ago
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 iterativ
70.
by aeon10 14y ago
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?