Jump to content

  • Log In with Google      Sign In   
  • Create Account


Reputation log glitch


Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.

  • You cannot reply to this topic
3 replies to this topic

#1 Bacterius   Crossbones+   -  Reputation: 8002

Posted 04 February 2013 - 12:30 AM

This happened a few minutes ago:

 

neye8l.png

 

 

And I cannot find the relevant post. Tried to reproduce by upvoting someone else, without luck. 


The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.

 

- Pessimal Algorithms and Simplexity Analysis


Sponsor:

#2 Ashaman73   Crossbones+   -  Reputation: 6595

Posted 04 February 2013 - 12:40 AM

This happens when you get an upvote in the developer journal section. You get the upvote here wink.png



#3 Bacterius   Crossbones+   -  Reputation: 8002

Posted 04 February 2013 - 12:52 AM

This happens when you get an upvote in the developer journal section. You get the upvote here wink.png

 

Aha, I see, that clears it up. Thanks!


The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.

 

- Pessimal Algorithms and Simplexity Analysis


#4 Cornstalks   Crossbones+   -  Reputation: 6966

Posted 04 February 2013 - 01:09 AM

I was gonna suggest phantom possibly voted you up, just because that would seem appropriate, given his name and the blank log entry...


[ I was ninja'd 71 times before I stopped counting a long time ago ] [ f.k.a. MikeTacular ] [ My Blog ] [ SWFer: Gaplessly looped MP3s in your Flash games ]




Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.



PARTNERS