Reverse Whitepages algorithm

names = list of all surnames (10,000s)

suburbs = list of all suburbs for target state (100s-1000s)



foreach (name in names)

{

    results = whitepageSearch(name, state);

    if (results = "too many")

    {

        foreach (suburb in suburbs)

        {

            results = whitepageSearch(name, suburb, state);

            store(results);

        }

    }

    else

    {

        store(results);

    }

}

Worst-case scenario: 20,000 last names x 1000 suburbs = 20,000,000 page look ups for one state. If it takes 1s to load a page, then it takes over 200 days to perform the lookup.