StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
20861289
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
6
CommunityOwnedDate
CreationDate
2013-12-31T17:46:31.883
FavoriteCount
0
LastActivityDate
2013-12-31T17:46:31.883
LastEditDate
LastEditorUserId
0
OwnerUserId
223226
ParentId
20857974
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
<p>Used <a href="http://en.wikipedia.org/wiki/Heapsort#Pseudocode" rel="nofollow">pseudocode</a></p> <pre><code>use strict; use warnings; my @a = reverse 1..500; heapSort(\@a); print "@a\n"; sub heapSort { my ($a) = @_; # input: an unordered array a of length count # (first place a in max-heap order) heapify($a); my $end = $#$a; # //in languages with zero-based arrays the children are 2*i+1 and 2*i+2 while ($end) { # (swap the root(maximum value) of the heap with the last element of the heap) @$a[$end, 0] = @$a[0, $end]; # swap(a[end], a[0]) # (decrease the size of the heap by one so that the previous max value will # stay in its proper placement) $end--; # (put the heap back in max-heap order) siftDown($a, 0, $end); } } sub heapify { my ($a) = @_; my $count = @$a; # (start is assigned the index in a of the last parent node) my $start = ($count - 2 ) / 2; while ($start >= 0) { #(sift down the node at index start to the proper place such that all nodes below # the start index are in heap order) siftDown($a, $start, $count-1); $start--; #(after sifting down the root all nodes/elements are in heap order) } } sub siftDown { my ($a, $start, $end) = @_; # input: end represents the limit of how far down the heap # to sift. my $root = $start; while ($root * 2 + 1 <= $end) { # (While the root has at least one child) my $child = $root * 2 + 1; # (root*2 + 1 points to the left child) my $swap = $root; # (keeps track of child to swap with) #(check if root is smaller than left child) $swap = $child if $a->[$swap] < $a->[$child]; #(check if right child exists, and if it's bigger than what we're currently swapping with) $swap = $child + 1 if $child+1 <= $end and $a->[$swap] < $a->[$child+1]; # (check if we need to swap at all) if ($swap != $root) { # swap(a[root], a[swap]) @$a[$root, $swap] = @$a[$swap, $root]; $root = $swap; # (repeat to continue sifting down the child now) } else { return; } } } </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POHeapsort function behaves the same with push and unshift.(Perl)
  singulars
  PostTypePostTypeId
  PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USСухой27
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POHeapsort function behaves the same with push and unshift.(Perl)
  singulars
  PostTypePostTypeId
  PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId

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.