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 pset5
Search options not deleted
user 28234
The problem set for Week 5 will challenge you to apply what you've learned about pointers, memory management, file i/o and structs, creating more complex data structures (such as Hash Tables or Tries) and leveraging their power to write a lightning-fast spell check algorithm.
0
votes
1
answer
209
views
Pset 5 Speller valgrind error
I am trying to fix the last error in my code pointed out by check 50. I think the problem is in my unload but can't say for sure. Here's my code. I know I have some basic functionalities wrong but eve …
1
vote
Accepted
Pset 5 Speller valgrind error
Okay, I fixed it. In load I hadn't initialized nod and tmp.
nod->next = NULL;
tmp->next=NULL;
-1
votes
Getting a segmentation fault when i try to run pset5 speller and i'm not sure what's the pro...
In your last unload function you are using
node *cusor = table[i]->next;
when table[I] in it self is a pointer.