@mootinator Well, yes, but then there are sometimes I feel like just working with existing frameworks instead of innovating. I can customize my app, or make it completely generic. It begins with the UI, but the attitude can continue through control paradigm. (Refresh button vs figuring out how to make pull to refresh).
How interesting. I was logged out of Money.SE. I clicked on login, was about to click my OpenID provider, then the top bar appeared to tell me that I've been logged in.
@mootinator What are you writing it in, by the way? Since I already started, if you actually have the drive to make that happen I could see if I can dig up the implementation I created.
I was thinking Python, though I was still at the screwing around on a conceptual level, so I don't have any other code than a php script to handle 404 errors which returns the relevant environment variables as JSON.
Sometimes when web developers design a site they think, "I'd like to have SEO friendly URLs" Now they have three problems.
I'm listening to recorded lectures from the chair of my dept. He says that "C is permissive" and that there "is a C statement that lets you blow up your screen". Is that an oversimplification, or was there a specific way to do it?
welp, perhaps I'll check back later for comments to this suggestion:...
I think there should be a bonus to the weight for answers that are accepted when the answer was (1) the first one given and (2) a certain time passed before the answer was given
These would be fairly small bonuses (something like the standard 15 + bonus of 5 for 6-24 hours before the first answer, and maybe something like 15+10 if the answer was the first, but greater than 24 hours after the question was asked.
so, a question asked at 8:00AM is not answered and goes off the list of popular, etc.
at 4:00 PM, someone finds it and provides an answer, which is later accepted.
instead of the normal +15, the answer-er gets +20 rep
I hope that's clear - it's primarily a tiny incentive for people to review older, unanswered questions, rather than EVERYONE following a particular tag jumping on the new questions, then losing interest
People change and improve. Bad code is bad code. I want to be able to downvote questions and answers owned by my account. Not all of the posts were made by me; the admins merged my brother's account and my sister's account with mine in 2008 or 2009.
@Fosco I'm against this, depending of course, on how you define "unanswered", because all I need to do is wait before selecting an answer. Easy gaming of the system.
indeed - in this case, I would not have gotten the bonus, but it encourages a small contingent of people to review questions from much earlier today or a day or two ago, and make sure that they really aren't worth an answer
Additionally, (in my original thought, at least) it would only be if the FIRST answer (provided after [e.g.] 6 hours) was accepted.
It might as an alternative, be given to ANY answer that was provided after the time limit. - it's a motivation to keep trying to answer a question (to balance the idea of answering MORE questions)
and it would still be subject to the normal efforts to make sure people aren't answering and accepting their own answers with different accounts
anyways - thanks for the feedback
yowza - masi asked 14 questions in less than 2 hours? WTF?
@CodeJockey I spend time on SO too, but I can't answer that many questions, and the ones I can answer usually get jumped on by other people before I finish writing.
the quick process is: division point is directly below largest pancake out of order. flip it so it is on top. flip entire unsorted stack, division point being just above top properly sorted pancake.
I think they are wrong... pancake flipping is not NP hard...
Or more likely, there is part of it I am not understanding. :)
I just read through the whole arxiv PDF, and cannot believe the depth of math they go to for this...
Also, the references are quite hilarious... [13] A. Labarre and J. Cibulka. Polynomial-time sortable stacks of burnt pancakes. Theoretical Computer Science, 412(8-10):695{702, 2011.
An article posted yesterday (http://www.i-programmer.info/news/112-theory/3280-pancake-flipping-is-hard-np-hard.html) references a new study released on Arxiv (http://arxiv.org/abs/1111.0434v1) with the following summary:
Pancake Flipping is the problem of sorting a stack of pancakes of diffe...
I just found the future tag on Stack Overflow.
Most questions there (now 109 non-closed) ask about events that will or will not happen in the future (relative to the time the question was asked or is read).
Most of these are either off-topic (not about programming), not constructive ("What do y...
I hate to be uninspiring, de-motivational, and/or dissatisfying, but I suggest we blacklist the following tags:
inspiration: 19 questions, 2 of which are closed
motivation: 60 questions, 13 of which are closed
motivation-techniques: 10 questions, 2 of which are closed
satisfaction: 2 questions,...
When I originally wrote this request, I was basing it off of Jeff's assertion that "expletives are not acceptable behavior on meta or any other Stack Overflow site." After going through a number of these posts, however, I also found that the use of the word "damn" is often an indicator of a lo...
that was originally tagged [posse]. And it was about SO cleanup. But, not about tags (although a bit of a ruckus involving tags did kick up shortly afterwards)
> They are saying exactly that - it's easy to see that any stack can be flipped in 2n−1 flips as you point out, but the question is, what's the precise bound?
^ Who gives a flying pancake?
The paper said we didn't know the 'maximum'... the maximum is 2n-1. I do not understand any further computation. :)
i don't even know what that means, the precise bound.