CS50_week5 Data Structures

typedef struct
{
    string name;
    int votes;
} candidate;

typedef struct node
{
    int number;
    struct node *next;
} node;

node *list = NULL;
node *n = malloc(sizeof(node));
n->number = 1;
n->next = NULL;
list = n;

#include <stdio.h>
#include <stdlib.h>

typedef struct node
{
    int number;
    struct node *next;

} node;

int main(int argc, char *argv[])
{
    node *list = NULL;

    for (int i = 1; i < argc; i++)
    {
        int number = atoi(argv[i]);
        node *n = malloc(sizeof(node));
        if (n == NULL)
        {
            //free memory thus far
            return 1;
        }
        n->number = number;
        n->next = list;
        list = n;
    }
    //print whole list
    node *ptr = list;
    while (ptr != NULL)
    {
        printf("%i\n", ptr->number);
        ptr = ptr->next;
    }
}

// Implements a list of numbers using a linked list
 
#include <cs50.h>
#include <stdio.h>
#include <stdlib.h>
 
typedef struct node
{
    int number;
    struct node *next;
}
node;
 
int main(int argc, char *argv[])
{
    // Memory for numbers
    node *list = NULL;
 
    // For each command-line argument
    for (int i = 1; i < argc; i++)
    {
        // Convert argument to int
        int number = atoi(argv[i]);
 
        // Allocate node for number
        node *n = malloc(sizeof(node));
        if (n == NULL)
        {
            return 1;
        }
        n->number = number;
        n->next = NULL;
 
        // If list is empty
        if (list == NULL)
        {
            // This node is the whole list
            list = n;
        }
 
        // If list has numbers already
        else
        {
            // Iterate over nodes in list
            for (node *ptr = list; ptr != NULL; ptr = ptr->next)
            {
                // If at end of list
                if (ptr->next == NULL)
                {
                    // Append node
                    ptr->next = n;
                    break;
                }
            }
        }
    }
 
    // Print numbers
    for (node *ptr = list; ptr != NULL; ptr = ptr->next)
    {
        printf("%i\n", ptr->number);
    }
 
    // Free memory
    node *ptr = list;
    while (ptr != NULL)
    {
        node *next = ptr->next;
        free(ptr);
        ptr = next;
    }
}   

        
// Implements a sorted list of numbers using a linked list
 
#include <cs50.h>
#include <stdio.h>
#include <stdlib.h>
 
typedef struct node
{
    int number;
    struct node *next;
}
node;
 
int main(int argc, char *argv[])
{
    // Memory for numbers
    node *list = NULL;
 
    // For each command-line argument
    for (int i = 1; i < argc; i++)
    {
        // Convert argument to int
        int number = atoi(argv[i]);
 
        // Allocate node for number
        node *n = malloc(sizeof(node));
        if (n == NULL)
        {
            return 1;
        }
        n->number = number;
        n->next = NULL;
 
        // If list is empty
        if (list == NULL)
        {
            list = n;
        }
 
        // If number belongs at beginning of list
        else if (n->number < list->number)
        {
            n->next = list;
            list = n; 
        }
 
        // If number belongs later in list
        else
        {
            // Iterate over nodes in list
            for (node *ptr = list; ptr != NULL; ptr = ptr->next)
            {
                // If at end of list
                if (ptr->next == NULL)
                {
                    // Append node
                    ptr->next = n;
                    break;
                }
 
                // If in middle of list
                if (n->number < ptr->next->number)
                {
                    n->next = ptr->next;
                    ptr->next = n;
                    break;
                }
            }
        }
    }
 
    // Print numbers
    for (node *ptr = list; ptr != NULL; ptr = ptr->next)
    {
        printf("%i\n", ptr->number);
    }
 
    // Free memory
    node *ptr = list;
    while (ptr != NULL)
    {
        node *next = ptr->next;
        free(ptr);
        ptr = next;
    }
}

typedef struct node
{
    int number;
    struct node *next;
} node;

typedef struct node
{
    int number;
    struct node *left;
    struct node *right;
} node;

bool search(node *tree, int number)
{
    if (tree == NULL)
    {
        return false;
    }
    else if (number < tree->number)
    {
        return search(tree->left, number);
    }
    else if (number > tree->number)
    {
        return search(tree->right, number);
    }
    else if (number == tree->number)
    {
        return true;
    }
}

typedef struct node
{
    char *name;
    char *number;
    struct node *next;
} node;

node *table[26];

#include <ctype.h>

int hash(char *word)
{
    return toupper(word[0]) - 'A';
}