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 valgrind
Search options answers only
not deleted
user 29265
1
vote
Speller program runs accurately with memory leaks. When I add free() to correct memory leak,...
You shouldn't free memory in load(). That's where unload() comes in. All of the memory allocated in the code should be freed in unload() only, except very specific cases (this was answered by a mentor …
1
vote
Accepted
Speller - not sure what's wrong
I believe the problem might be here:
for (int i = 0; i < N; i++)
{
//temp points to what table points to
temp = table[i];
//cursor points to what table points to
cursor = table[i];
…
1
vote
Speller Valgrind Issues
I believe there's still an error here, though I'm not entirely sure in this case:
for (int i = 0; i < N; i++)
{
if (table[i] != NULL)
{
//temp points to what table points to
te …