I really like this cheat sheet from Sergiy Kovalchuk’s blog entry, but unfortunately it is offline. However, the Wayback Machine has a historical copy: More detailed was Alexander Zagniotov’s flowchart, also offline therefor also a historical copy of the blog: Excerpt from the blog on concerns raised in comments: “This cheat sheet doesn’t include rarely … Read more
TSP is a difficult problem. Multi-TSP is probably much worse. I’m not sure you can find good solutions with ad-hoc methods like this. Have you tried meta-heuristic methods ? I’d try using the Cross Entropy method first : it shouldn’t be too hard to use it for your problem. Otherwise look for Generic Algorithms, Ant … Read more
You can often entirely preserve the original structure of a recursive algorithm, but avoid the stack, by employing tail calls and changing to continuation-passing, as suggested by this blog entry. (I should really cook up a better standalone example.)
Is there any systematic step-by-step or mathematical way to construct SQL query from a given human-readable description? Yes, there is. It turns out that natural language expressions and logical expressions and relational algebra expressions and SQL expressions (a hybrid of the last two) correspond in a rather direct way. (What follows is for no duplicate … Read more