I like the Arc idiom for this. Here's how to sort a list (say of stories) by some computed value (say a function called score):

  (sort (compute > score) stories)

If score is expensive, you just wrap it in memo:

  (sort (compare > (memo score)) stories)

Now it will compute each score once, save them in a table, and throw the table away when done.