C++ Data Structures and Algorithms

Performing sublist search algorithm

To perform the sublist search, we can invoke the SublistSearch() function and pass two lists. The following main() function will create two lists and invoke the SublistSearch() function:

int main(){    cout << "Sublist Search" << endl;    // Initialize first list    // 23 -> 30 -> 41    Node * node1_c = new Node();    node1_c->Value = 41;    Node * node1_b = new Node();    node1_b->Value = 30;    node1_b->Next = node1_c;    Node * node1_a = new Node();    node1_a->Value = 23;    node1_a->Next = node1_b;    // Print the first list    cout << "First list : ";    PrintNode(node1_a);    // Initialize second list    // 10 -> 15 -> 23 -> 30 -> 41 -> 49    Node * node2_f = new Node();    node2_f->Value = 49;    Node * node2_e = new Node();    node2_e->Value = 41; node2_e->Next ...