StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
10687971
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
3
CommunityOwnedDate
CreationDate
2012-05-21T15:15:42.360
FavoriteCount
0
LastActivityDate
2012-05-23T15:55:04.820
LastEditDate
2012-05-23T15:55:04.820
LastEditorUserId
900873
OwnerUserId
900873
ParentId
10687080
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
You have a redundant check causing an infinite loop. <pre><code>void sortNumbers() { ... int check = 1; if( check != 0 ) { ... sortNumbers(); } } </code></pre> Now, since this is clearly homework, I'll just give some general advice. In general, you use recursion to make a problem of a particular size smaller. Figure out what part of the problem is getting smaller each iteration, and just make each iteration a recursive call instead of a loop (hint: this means you'll probably want to pass some value into the method to tell you the size and/or location of the current iteration). And remember to have a check either at the beginning of the method or before you recurse to check the size of the problem. <hr> <pre><code>void loop() { int topLevel = 0; int currentSort = 0; /* You never initialize this - what's supposed to be in it? */ int numbers [49]; int sizeOfArray = sizeof(numbers)/sizeof(int); /* Two things here: you're passing an array (numbers) in where the sortNumbers() function has it declared as an int; and the return value is declared as an int, but you're storing it into an array. */ numbers = sortNumbers(topLevel,currentSort,sizeOfArray,numbers); } /* You're going to have to change this method signature - you're working with arrays, not plain ints. You're changing numbers[] inline, so you don't need to return anything. */ int sortNumbers(int p,int c,int l,int numbers) { /* The first iteration has c = 0, so [c-1] is going to be out-of-bounds. Also, when c = l, [c] will be out of bounds. */ if( numbers[c-1] > numbers[c] ) { int temp = numbers[c-1]; numbers[c-1] = numbers[c]; numbers[c] = temp; } if( c == l ) { c = 0; p++; } if( p == l+1 ) { return numbers; } return sortNumbers(p,c+1,l, numbers); } </code></pre> This isn't how I was thinking of doing it, but I believe it should work once you fix the problems I've pointed out (and possibly some I missed).
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. PORecursive Bubble Sort
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USKevin
UserOwnerUserId
1. USKevin
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. PORecursive Bubble Sort
 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
 VTUpMod
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
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.