Comments on: C++ Hash Table Memoization: Simplifying Dynamic Programming

By: Headline Writing Gone Bad

Headline Writing Gone Bad — Fri, 01 Oct 2010 15:36:42 +0000

[...] to a method for solving problems by decomposition. It’s a useful technique that I’ve covered here in the past, and any skilled programmer should be familiar with [...]

By: Mark Nelson

Mark Nelson — Thu, 02 Oct 2008 13:59:47 +0000

@dan:

I don’t really understand what you are getting at. Yes, you can use the less than operator to order, but in this case I have no need for that. I have a simple equality test, which is fine, so why do anything else?

By: dan

dan — Thu, 02 Oct 2008 13:39:51 +0000

“(It is not unusual to use the less-than operator to test for equality,
by testing both a > b and a 1, mGenre => “B” } and
(Instance 2) { mAge=>2, mGenre => “A” }

then (Instance 1) is not less than (Instance 2) and (Instance 2) is
not less than (Instance 1) and you might conclude they are equal.
When putting one after the other in a map it would overwrite.
Something like this should make it totally ordered.
return (that1.mAge

By: bulane

bulane — Tue, 19 Aug 2008 07:58:20 +0000

The article has been helpful to start my project

By: mais_tro

mais_tro — Fri, 14 Mar 2008 10:35:28 +0000

hey guys!!!
can u giv exact example on ur program!!!
that not having any error when we are going to copy it and run it to our compiler!!!!

By: Relations « zeroblog

Relations « zeroblog — Sun, 09 Dec 2007 23:35:53 +0000

[...] that relation syntax overlaps function syntax isn’t coincidental; it enables function result memoisation as part of the language, thus (hopefully) also improving the efficiency of zero programs. I’ll [...]