Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8355877
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 9, 20262026-06-09T09:59:47+00:00 2026-06-09T09:59:47+00:00

From Programming Pearls: Column 12: Searching: There are two code segments: IntSetList(int maxelements, int

  • 0

From Programming Pearls: Column 12: Searching:
There are two code segments:

    IntSetList(int maxelements, int maxval)
    {   sentinel = head = new node(maxval, 0);
        n = 0;
    }
    void report(int *v)
    {   int j = 0;
        for (node *p = head; p != sentinel; p = p->next)
            v[j++] = p->val;
    }

I’m curious how does the sentinel work in the report function?

If necessary, please see the complete source code.

Thanks,

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-09T09:59:48+00:00Added an answer on June 9, 2026 at 9:59 am

    sentinel is just the value that the last pointer in the list is expected to have; it’s the value that a next member has when it doesn’t point to anything. It’s initialized to point to the first, “dummy” node in the list; new items are inserted at the beginning, so the sentinel drifts to the end.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

here is code from programming pearls this code prints random numbers in decreasing form
I have this code from programming pearls #include <iostream> //#include <string> using namespace std;
Here are functions on strings from programming pearls. int wordncmp(char *p, char* q) {
i have implement this code from programming pearls and i think it should be
I have to implement quicksort. From Programming Pearls here is the code: public class
From Programming Pearls : Column 12: A Sample Problem : The input consists of
Here is a problem from Programming Pearls 2nd edition (Chapter 8.7): Considering a real
I don't understand why authors said that Code Listing 9.1 from Programming in Scala
I am learning object orientated programming from the online Stanford courses there is a
From programming pearls, it is known that array[1...n] has heap property if for all

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.