StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
9079582
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2012-01-31T12:35:05.590
FavoriteCount
0
LastActivityDate
2012-01-31T13:07:58.320
LastEditDate
2012-01-31T13:07:58.320
LastEditorUserId
602372
OwnerUserId
602372
ParentId
9077789
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
First of all, thanks for the answers. They pointed me to the right solution. I voted them up to give credit, but since I managed to solve this question, I'll accept my own answer (at least until a better one comes). So first of all, the homework was about "Taxies" (you know how homework is...) and a TaxiQueue, in Java. The solution was: <pre><code>public void sort() { sort(this); } private void sort(TaxiQueue toSort) { // Prepare split parts for later merging TaxiQueue m1 = new TaxiQueue(), m2 = new TaxiQueue(); // Return if there's only 1 element in the queue // since it's essentially "sorted". if(singleItem(toSort)) return; // Split toSort into 2 parts split(toSort, m1, m2); // Sort each part recursively (by splitting and merging) sort(m1); sort(m2); // Merge each part into 1 sorted queue merge(toSort, m1, m2); } private boolean singleItem(TaxiQueue tq) { Taxi temp = tq.dequeue(); boolean retVal = tq.empty(); tq.enqueue(temp); return retVal; } private void merge(TaxiQueue toSort, TaxiQueue m1, TaxiQueue m2) { // Notice that m1 and m2 are already sorted, and now we need // to merge them. // In the case that one of them is empty and the other one isn't, // simply append all remaining "higher" values into toSort. if(m1.empty()) { appendQueue(m2, toSort); return; } else if (m2.empty()) { appendQueue(m1, toSort); return; } // The critical comparison part... if(m1.peek().getId() < m2.peek().getId()) toSort.enqueue(m1.dequeue()); else toSort.enqueue(m2.dequeue()); // Continue merging elements into toSort. merge(toSort, m1, m2); } // Split toSort into m1 and m2 as equally as possible private void split(TaxiQueue toSort, TaxiQueue m1, TaxiQueue m2) { if(toSort.empty()) return; m1.enqueue(toSort.dequeue()); split(toSort, m2, m1); } // Enqueue everything in src to dest. private void appendQueue(TaxiQueue src, TaxiQueue dest) { if (src.empty()) return; dest.enqueue(src.dequeue()); appendQueue(src, dest); } </code></pre> I hope that other students may find it useful some day!
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POSorting a Queue Using Recursion
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USYam Marcovic
UserOwnerUserId
1. USYam Marcovic
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POSorting a Queue Using Recursion
 singulars
 PostTypePostTypeId
 PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
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.