StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
15051833
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-02-24T12:43:34.333
FavoriteCount
0
LastActivityDate
2013-02-24T12:43:34.333
LastEditDate
LastEditorUserId
0
OwnerUserId
1596193
ParentId
8460167
PostTypeId
2
Score
3
ViewCount
0
LastEditorDisplayName
text
Body
<pre><code>This is heap_sort which uses heapify and max heap concepts. I coded as per the algorithm in "Intro to Algos" book. Have a look. #include "stdafx.h" #define LEFT(i) (2 * (i)) #define RIGHT(i) (((2 * (i)) + 1)) #define PARENT(i) ((i) / 2)) void print_heap(int input[], int n) { int i; printf("Printing heap: \n"); for (i = 0; i < n; i++) printf("%d ", input[i]); printf("\n"); } void swap_nodes(int *a, int *b) { int tmp; tmp = *a; *a = *b; *b = tmp; } void max_heapify(int input[], int i, int n) { int largest; int l = LEFT(i + 1) - 1; // Get 0 based array index int r = RIGHT(i + 1) - 1; // Get 0 based array index if (l < n && input[l] > input[i]) { largest = l; } else { largest = i; } if (r < n && input[r] > input[largest]) { largest = r; } if (largest != i) { swap_nodes(&input[i], &input[largest]); max_heapify(input, largest, n); } } void heapify(int input[], int n) { for (int i = n/2; i >= 0; i--) max_heapify(input, i, n); } void heap_sort(int input[], int n) { heapify(input, n); for (int i = n - 1; i >= 1; i--) { swap_nodes(&input[0], &input[i]); n = n - 1; max_heapify(input, 0, n); } } int _tmain(int argc, _TCHAR* argv[]) { //int input[] = {6, 5, 3, 1, 8, 7, 4, 2}; //int input[] = {4, 1, 3, 2, 16, 9, 10, 14, 8, 7}; int input[] = {5, 3, 17, 10, 84, 19, 6, 22, 9, 1}; //int input[] = {16, 14, 10, 8, 7, 9, 3, 2, 4, 1}; int n = sizeof(input) / sizeof(input[0]); print_heap(input, n); heap_sort(input, n); print_heap(input, n); return 0; } </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POHeap sort is outfoxing me
  singulars
  PostTypePostTypeId
  PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USuser1596193
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. 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
  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.