C++ Data Structures and Algorithms

Designing sublist search algorithm

Let's design the C++ program for this searching algorithm. First, we are going to develop a SublistSearch() function that will compare the first element of the first list with all elements of the second list. The code should be as follows:

bool SublistSearch(    Node * firstList,    Node * secondList){    // If both are NULL,    // just return true    if(firstList == NULL && secondList == NULL)    {        return true;    }    // If one is NULL but the other is not,    // just return false    if((firstList != NULL && secondList == NULL) ||        (firstList == NULL && secondList != NULL))    {        return false;    }    // Compare the value, if not match,    // check next element of second list    if (firstList->Value == secondList->Value)    { // If matched, check deeper ...