StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POError in trying to count the nodes in circular doubly linked list recursively
primarykey
Id
7924575
data
AcceptedAnswerId
7925308
AnswerCount
4
ClosedDate
CommentCount
1
CommunityOwnedDate
CreationDate
2011-10-28T02:40:17.007
FavoriteCount
0
LastActivityDate
2013-11-07T16:15:27.267
LastEditDate
2011-10-28T03:30:50.553
LastEditorUserId
1017072
OwnerUserId
1017072
ParentId
0
PostTypeId
1
Score
0
ViewCount
1133
LastEditorDisplayName
text
Body
Here is my implementation of count: <pre><code>int count(node *start) { static int l ; node *current; /* Node for travelling the linked list*/ current=start; if(current->next!=start) { l = 1 + count ( current->next ) ; return ( l ) ; } else { return(1); } } </code></pre> Here is a fragment of main function where I am calling it: <pre><code>void main() { node *head; printf ( "Length of linked list = %d", count ( head ) ) ; } </code></pre> Here is the structure: <pre><code>struct cirdoublelinklist { struct cirdoublelinklist *prev; /** Stores address of previous node **/ int value; /** stores value **/ struct cirdoublelinklist *next; /** stores address of next node **/ }; /** Redefining list as node **/ typedef struct cirdoublelinklist node; </code></pre> On running and trying to see the length of a list, it crashes with out of bound memory. Please help me with this, I have been working on this for a long time now. Method to add the first node: <pre><code>void initialize(node *start) { start->prev=start; printf("\nEnter Value\n"); scanf("%d",&start->value); start->next=start; } </code></pre> Method to add subsequent nodes after the location specified: <pre><code>void insert_after(node *start) { int num; /* value for inserting a node */ int flag=0; node *newnode; /* New inputed node*/ node *current; /* Node for travelling the linked list*/ newnode=(node*)malloc(sizeof(node)); printf("\nEnter the value after which you want to insert a node\n"); scanf("%d",&num); init(newnode); current=start; while(current->next!=start) { if(current->value==num) { newnode->next=current->next; current->next->prev=newnode; current->next=newnode; newnode->prev=current; flag=1; } current=current->next; } if(flag==0 && current->next==start && current->value==num) { /*** Insertion checking for last node ***/ newnode->next=current->next; /* Start is being copied */ current->next->prev=newnode; current->next=newnode; newnode->prev=current; flag=1; } if(flag==0 && current->next==NULL) printf("\nNo match found\n"); } </code></pre>
Tags
<c><linked-list>
Title
Error in trying to count the nodes in circular doubly linked list recursively
singulars
PostAcceptedAnswerId
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USuser1017072
UserOwnerUserId
1. USuser1017072
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
2. PO
 singulars
 PostTypePostTypeId
 PTAnswer
3. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId
1. COWhy did you make `l` static? That just prevents the function from being fully reentrant, which is usually a requirement for proper recursion.
 singulars
 PostPostId
 POError in trying to count the nodes in circular doubly linked list recursively
 UserUserId
 USIgnacio Vazquez-Abrams

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.