Longest common subsequence: Difference between revisions

← Older editNewer edit →
Content deleted Content added
CNHume (talk | contribs)
159 edits
m Clarified preferNextIndex2 optimization to the Hunt and Szymanski algorithm.
CNHume (talk | contribs)
159 edits
m Completing prior edit.
Line 513:
#include <iostream>
#include <deque>
#include <unordered_map> //[C++11]
#include <algorithm> // for lower_bound()
#include <iterator> // for next() and prev()
Line 588:
// of Pair allocations by factors ranging from 2 up to 10 or more.
//
if (skipIndex2preferNextIndex2) continue;
 
if (limit == threshold.end()) {
Retrieved from "https://rosettacode.org/wiki/Longest_common_subsequence"