typedef struct {
  /** Number of words in the wordlist. */
  int len;
  /** Capacity of the WordList, so we can know when we need to resize. */
  int capacity;
  /** List of words.  Should be sorted lexicographically once the word list
      has been read in. */
  Word *words;
} WordList;

/**
 * comparison function for qsort in readWordList
 */
static int cmp(const void *p1, const void *p2){
  return strcmp(* (char * const *)  p1, * (char * const *) p2);
}

WordList *readWordList( char const *fname ){
  //malloc space for newList
  WordList *newList = ( WordList * ) malloc( sizeof( WordList ) );
  //set capacity to 10
  newList->capacity = START_CAPACITY;
...
  newList->words = ( Word * ) calloc(newList->capacity, sizeof( Word ) );
...
  while( fscanf( toRead, "%d ", &numChars ) == 1 )
  {
    //realloc space for Word *words if necessary
    if(newList->len >= newList->capacity)
    {
      newList->capacity *= 2;
      //check dereferencing
      newList->words = (Word *)realloc(newList->words, newList->capacity * sizeof(Word));
    }
    //if word is longer than 20 chars skip it
    if(numChars > WORD_MAX)
      continue;
    else
    {
      for(int i = 0; i < numChars; i++)
      {
        ch = fgetc(toRead);
          if(validChar(ch)){
            newList->words[newList->len][i] = ch;
            if(i == numChars-1){
              newList->words[(newList->len)][numChars] = '\0';
            }
          }else{
            continue;
          }
      }
      //debug
      printf("%s\n",newList->words[newList->len]);
      //increase length of wordlist
      newList->len += 1;
    }
  }
  qsort(newList->words, newList->len, sizeof(Word), cmp);
  return newList;
}

playground tough fucked around with this message at 08:52 on Nov 12, 2015

Raenir Salazar fucked around with this message at 14:00 on Nov 16, 2015

public static bool TryParse(string s, out int result);

public bool TryParse(string s, int& result);

void method() { int i; if(!TryParse("someString", i) { ... } ... }

Chuu fucked around with this message at 02:35 on Nov 20, 2015

OneEightHundred fucked around with this message at 03:09 on Nov 20, 2015

bool TryParse(string s, int *result_out);

sarehu fucked around with this message at 06:04 on Nov 20, 2015

Node *minVal
Node *temp
temp = head; 

int numEntries = 0; 

while(temp != null) // Find the # of entries in the list 
{
	numEntries++;
	temp = temp->next; 
}

For(int i = 0; i < numEntries; i++) // Want to print all nodes in alphabetical order. 
{
	temp = head; 
	minVal = head. 

	while(temp!=Null) // cycle through the linked list to find min value. 
	{
		if(minVal->song < temp->song)
		{
			//update the min value
		}
		temp = temp->next; 
		
	}
	cout << the minvalue
	// eliminate the minNode printed from the list to prevent it from being found again. 
}

Diametunim fucked around with this message at 07:01 on Nov 20, 2015

sarehu fucked around with this message at 07:49 on Nov 20, 2015