StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POPrint an ordered linked list
primarykey
Id
13240332
data
AcceptedAnswerId
0
AnswerCount
2
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2012-11-05T21:03:20.323
FavoriteCount
0
LastActivityDate
2015-02-11T05:13:44.177
LastEditDate
2015-02-11T05:13:44.177
LastEditorUserId
3366929
OwnerUserId
1801067
ParentId
0
PostTypeId
1
Score
1
ViewCount
387
LastEditorDisplayName
text
Body
<p>Just did some editing on it, i tried what you said but it didnt work, so i tried something i am a little more familiar with but it doesnt seem to work correctly. It prints the information weirdly then crashes.. For exmaple: When i imput 9-8-7-6-5-4-3-2-1 then 0 to print, it prints back to me 0-0-0-9-1-2-3-4-5-6-7-8 and then crashes? when i imput 1-2-3-4-5-6-7-8-9 then 0 to print, it prints back to me 0-0-0-1-2-3-4-5-6-7-8-9 and then crashes.</p> <pre><code>#include <stdio.h> #include <stdlib.h> struct listNode{ int data; //ordered field struct listNode *next; }; //prototypes void insertNode(struct listNode *Head, int x); int printList(struct listNode *Head); int freeList(struct listNode *Head, int x); //main int main(){ struct listNode Head = {0, NULL}; int x = 1; int ret = 0; printf("This program will create an odered linked list of numbers greater" " than 0 until the user inputs 0 or a negative number.\n"); while (x > 0){ printf("Please input a value to store into the list.\n"); scanf("%d", &x); insertNode(&Head, x); } ret = printList(&Head); } void insertNode(struct listNode * Head, int x){ struct listNode *newNode, *current; newNode = malloc(sizeof(struct listNode)); newNode->data = x; newNode->next = NULL; current = Head; while (current->next != NULL && current->data < x) { current = current->next; } if(current->next == NULL){ current->next = newNode; } else{ newNode->next = current->next; current->next = newNode; } } int printList(struct listNode * Head){ struct listNode *current = Head; while (Head != NULL){ printf("%d \n", *current); current = current->next; } } </code></pre>
Tags
<list><linked-list><sorted>
Title
Print an ordered linked list
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USuser1801067
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. PL
  singulars
  LinkTypeLinkTypeId
  LTLinked
2. PL
  singulars
  LinkTypeLinkTypeId
  LTLinked
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
  singulars
  PostTypePostTypeId
  PTAnswer
2. PO
  singulars
  PostTypePostTypeId
  PTAnswer
VotesPostIdCreationDate
1. VO
  singulars
  PostPostId
  POPrint an ordered linked list
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTClose
2. VO
  singulars
  PostPostId
  POPrint an ordered linked list
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTUpMod
CommentsPostId
1. This table or related slice is empty.

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.