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 17148
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
245
views
i keep on getting segmentation fault in pset5
// Returns true if word is in dictionary else false
bool check(const char *word)
{
//change letters to lowercase
int length = strlen(word);
char copy[length + 1];
for (int i = 0; i < length; i …
1
vote
Accepted
i keep on getting segmentation fault in pset5
tried using to debugger to find the loc which results in seg fault
0
votes
2
answers
69
views
load function in speller not working properly not seem to figure out the correct way to link...
Implements a dictionary's functionality
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <strings.h>
#include "dictionary.h"
Repr …