StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POEasiest to implement online sorted data structure in C
primarykey
Id
5625039
data
AcceptedAnswerId
5625044
AnswerCount
4
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2011-04-11T17:23:28.993
FavoriteCount
1
LastActivityDate
2011-04-19T04:31:59.153
LastEditDate
2011-04-18T07:12:51.603
LastEditorUserId
527702
OwnerUserId
527702
ParentId
0
PostTypeId
1
Score
1
ViewCount
957
LastEditorDisplayName
text
Body
I'm scanning a large data source, currently about 8 million entries, extracting on string per entry, which I want in alphabetical order. Currenlty I put them in an array then sort an index to them using <code>qsort()</code> which works fine. But out of curiosity I'm thinking of instead inserting each string into a data structure that maintains them in alphabetical order as I scan them from the data source, partly for the experience of emlplementing one, partly because it will feel faster without the wait for the sort to complete after the scan has completed (-: What data structure would be the most straightforward to implement in C? UPDATE To clarify, the only operations I need to perform are inserting an item and dumping the index when it's done, by which I mean for each item in the original order dump an integer representing the order it is in after sorting. SUMMARY <ul> <li>The easiest to implement are binary search trees.</li> <li>Self balancing binary trees are much better but nontrivial to implement.</li> <li>Insertion can be done iteratively but in-order traversal for dumping the results and post-order traversal for deleting the tree when done both require either recursion or an explicit stack.</li> <li>Without implementing balancing, runs of ordered input will result in the degenerate worst case which is a linked list. This means deep trees which severely impact the speed of the insert operation.</li> <li>Shuffling the input slightly can break up ordered input significantly and is easier to implement that balancing.</li> </ul>
Tags
<c><sorting><data-structures><binary-tree><binary-search-tree>
Title
Easiest to implement online sorted data structure in C
singulars
PostAcceptedAnswerId
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. UShippietrail
UserOwnerUserId
1. UShippietrail
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. VO
 singulars
 PostPostId
 POEasiest to implement online sorted data structure in C
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 POEasiest to implement online sorted data structure in C
 UserUserId
 USMickey Shine
 VoteTypeVoteTypeId
 VTFavorite
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.