StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
14399983
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-01-18T13:29:21.323
FavoriteCount
0
LastActivityDate
2013-01-18T13:37:04.723
LastEditDate
2013-01-18T13:37:04.723
LastEditorUserId
1955509
OwnerUserId
1955509
ParentId
14366323
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
This recursive approach isn't going to work very well, because as you've spotted when you remove items from the array you'll have to move everything down. This will mess up the offsets in the list for the parent recursive call. You could modify the call to <code>merge</code> so that the arguments are pointers and they get updated to the new values if the list is resized. Then you'd also have to have <code>remove_duplicates</code> also return these values in the same way. This is likely to be quite fiddly, but if you're changing the size of the list then I don't see any other approach - parent calls in the recursion chain need to know that their bounds have changed by the inner calls deleting items from the list. Just remember to take a copy of the values passed in by pointer before passing them into the next call down, or you'll just have pointers to the same variables all the way down and that will break things horribly. However, do you really need to use a recursive approach? I don't think it's either the easiest or most efficient approach - in this case, an iterative method is likely to be far easier to implement. You seem to be using linked lists, so an iterative approach might look like this: <pre><code>void remove_duplicates(ListItem *items) { while (items) { ListItem *current = items; while (current->next) { if (current->next->item == items->item) { current->next = current->next->next; } else { current = current->next; } } items = items->next; } } </code></pre> I've assumed your lists are terminated by a NULL <code>next</code> pointer in this example, but it should be easy to adapt for length-bounded lists as well. I've also assumed it's only singly-linked - the basic approach for doubly-linked lists would be similar but of course you need to update both next and previous pointers.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POI need to remove duplicates from a list recursively using merge principles using C
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USCartroo
UserOwnerUserId
1. USCartroo
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. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
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.