Longest common subsequence: Difference between revisions
m
Completing prior edit.
m (Clarified preferNextIndex2 optimization to the Hunt and Szymanski algorithm.) |
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 (
if (limit == threshold.end()) {
| |||