Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with pset3
Search options not deleted
user 1603
The problem set for Week 3 asks students to write code for a classic puzzle game in the C programming language.
3
votes
My sort and search functions don't work for find.c - look at my code?
Think about what is happening in your sorting algorithm.
When you are doing a swap algorithm, you need a third variable to store the value of one variable temporarily.
For example, if we have a = 5 a …
- 182
3
votes
pset 3 "control may reach the end of a non-void function"
Your function is declared as having a return type, but the structure of your function is not guaranteed to return anything.
For example, if you have:
bool myfunction(int x)
{
if(x > 10)
{
…
- 182