Search:

It's like the difference between shipping a house to someone so that they can see it, or sending them the house address so they can go see it where it's at. Which is more efficient?

Well, it is, but when you have someone else do your hw for you, it's going to catch up with you.

for(i=0; i<4; i++){
if(array[i]>maxvalue)
maxvalue = array[i];


This sounds like homework, so make sure you understand it.

t should have been the newstring. I edited the names to make it easier to read and missed that one.

To split up strings and find a certain word out of them use strtok.

Not sure about finding position.


newstring = strtok(oldstring," ");
while(newstring != NULL)
{
...

can you post the whole program?

I only get an error on line 4/5- time_t and t aren't declared


int dealCard(int * numCards, int cards[52])
{
int cardDrawn, subDraw;
time_t t; ...

I think it should be --

Most common users are students by far I'd say.

Why? It's primative enough you learn all the things that other languages do for you.

I have a feeling you're going to need to be a little more descriptive of this.

I'm sorry, I understand the theory, but the dynamic scaling is something that my professor requires. I honestly just don't get the code implementation, and I've been searching for the past week to...

Ok, I apologize, I'm still lost.

To create a new hash table


struct HashTable* newHashTable()
{
int i;
struct HashTable* newguy = (struct HashTable*)malloc(sizeof(struct...

Thanks. I think this should be enough code to get me going!

Right, I get the concept, at least I think I do

hashtable[0]=word-> word-> word....
hashtable[1]=word-> word-> word....
hashtable[2]=word-> word-> word....

The code however, I'm clueless. ...

I apologize if I'm missing the obvious here...I know this is one of the more basic data structures in C.

My understanding of how to create a linked list is to declare a node....


struct node{...

What I don't get though, is how do you dynamically create a linked list? My experience has been just using one at a time.

Can I just do this?



struct HashTable
{

int* store;

I'm attempting to write a program for class that takes a dictionary file and reads it into a hash table. Then it will prompt the user for their file that they wish to spell check against the...