838 karma · joined April 2, 2010
javascript:window.location="http://"+window.location.search.match(/id=(\S+)/)[1]+".com"
I don't entirely agree. It's possible to do it at BigCo too. You make it sound as if it's impossible. It's probably harder than at a startup, but not the impossible tone you give to it.
If k ∈ Θ(log N), then O(Nk) becomes O(N log N), which is asymptotically no better than any optimal comparison based sort.
However, if k ∈ o(log N), then we get an asymptotically better algorithm.
The reasons are many, and depend a lot on what you want from the hackathon and what others (the ones you'll be hacking with want).
For example, in a small company setting, hackathons are great to implement features or fix-bugs that have been lying around for a while. It's a concentrated effort to get something done.
In a medium sized setting, a hackathon might serve the purpose more of enabling newbies (or people from outside a certain team) to get to know another team's code-base and philosophy.
In a slightly larger sized company setting, a hackathon might just be more about idea exchange and getting to know people simply because there might be a lack of focus with so many people around.
That's just my take on hackathons. I'm sure there are other more interesting views on it.
And whatever you do, please sleep well and eat healthy when you're participating in one.
For practical considerations would you still choose scheme, or would you try and see if some massaging of python can get you the desired results - purely because of the simplicity and adoption rate of the language?
I would be interested in knowing other solutions that work for you.