Tuesday, February 12, 2013

Longest common subsequence

Longest common subsequence: "When you’ve run out of main memory, any estimate of runtime based on big-O analysis becomes useless. The system either crashes or thrashes, paging in virtual memory. By contrast, if we can reduce the memory required by a program, the time analysis should still hold — we never have to page in more time."

'via Blog this'