Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

Algorithms.js – Atwood's Law applied to CS101

github.com

Post reply on HN
Print view View original

31–36 of 36 posts

Re: Algorithms.js – Atwood's Law applied to CS101

#31

Post by wnevets »

feliperibeiro wrote: post #10
teh_klev wrote: post #8

Earlier quoted context omitted.

See: http://blog.codinghorror.com/the-principle-of-least-power/ "Atwood's Law: any application that can be written in JavaScript, will eventually be written in JavaScript." It's kind of a joke thing.

Exactly! Also, many JS devs are clueless about CS101 basic things, it's a way to maybe make them a bit interested. From the wiki ( https://github.com/felipernb/algorithms.js/wiki ): The intention is to blend academic concepts with the JavaScript bits of insanity, applying Atwood's Law to CS101.

While I may not be clueless, post like this do make me more interested.

Re: Algorithms.js – Atwood's Law applied to CS101

#32

Post by CmonDev »

kaizeroskilo wrote: post #22

Why is this even on hn? Are you kidding me? I have some college projects too you know...

I see you are new to HN. Basically any old code re-implemented in is JS suddenly considered cool.

Example:

P: Look I have a spinning cube in 3d at 30 FPS!

HN: OMG, awesome, never done before!

Re: Algorithms.js – Atwood's Law applied to CS101

#33

Post by CmonDev »

delluminatus wrote: post #19
akilism wrote: post #17

Earlier quoted context omitted.

What percentage would you say are clueless about CS101 basic things?

I would estimate 75% of Web developers are "clueless" about algorithms and data structures (although that's a fairly strong word).

Its sounds correct.

Re: Algorithms.js – Atwood's Law applied to CS101

#34

Post by jerf »

shoki wrote: post #25
TheLoneWolfling wrote: post #20

Earlier quoted context omitted.

Considering that the Fibonacci sequence is exponential, and hence the Nth Fibonacci number contains O(n) digits (well, in any sane base at least), you cannot compute the Nth Fibonacci number in under O(n) time.

Given the guys programming in Javascript and not using arbitrary precision arithmetic, he's always using 64 bits and representing his numbers as floating point, so I don't think you are reasoning correctly about the asympototic complexity here. I mean, if you really want to argue this, then to quote Leibniz: "Calculemus!" The javascript solution presented does everything in O(n) arithmetic operations, and the SICP wa…

If we're going to stick to a fixed precision numbers, and we're just out to score maximum internet points, you can do it in O(1) by just computing out a table in advance, and for not much storage space since the series grows exponentially.

I mean, if we're going to screw around with the Os let's do it properly.

Re: Algorithms.js – Atwood's Law applied to CS101

#35

Post by revdinosaur »

delluminatus wrote: post #19
akilism wrote: post #17

Earlier quoted context omitted.

What percentage would you say are clueless about CS101 basic things?

I would estimate 75% of Web developers are "clueless" about algorithms and data structures (although that's a fairly strong word).

Do you include in your estimate those who may currently be JS developers not by choice but due to the vogue of web apps?
Post reply on HN