Question

                                                                                                                       The language should be in C

Specifications

Use this structure and constant for the linked list node:

#define MAX_STR_LEN     80

struct link_node

{

char node_str[ MAX_STR_LEN ];

struct link_node *next;

};

Your solution should incorporate the following functions

// This function is used to compare two nodes.

// The return values are:

// -1: n1 < n2

// 0: n1 == n2

// +1: n1 > n2

int compare_node( struct link_node *n1, struct link_node *n2 );

// This function is used to add a new node into the

// alphabetically sorted linked list. The head of the

// list is pointed to by 'list'.

//

// The return value is the (possibly new) head pointer.

struct link_node *add_node( struct link_node *list,

                           struct link_node *node );

// Follow the linked list and print out each node along the way.

void display_list( struct link_node *head );

Use malloc() to create new link_node structures.

Use fgets() to read the user’s input string.

Pseudo-Code

Following is the start of some pseudo code for this lab. Expand on this to fully describe your solution:

Give the user some instructions on what to do.

WHILE ( the user doesn’t enter an “empty” string )

Get the user entered string.

Allocate a new node.

Initialize the node with the user’s string.

Add the node to the list in alphabetic order.

END-WHILE

Display the linked list of strings.

Example

Following is an example of running the program:

Please enter strings. When you are done, enter a blank line.

> Ken Arnold

> Tony Montiel

> Boba Fett

> Hoban Washburne

> Neil Armstrong

>

Boba Fett

Hoban Washburne

Ken Arnold

Neil Armstrong

Tony Montiel

if possible

You used malloc() to allocate the nodes. Do the right thing, and use free() to release the memory.

With fgets(), you may have noticed that it copies over the new-line character. Get rid of that pesky extra character.

Answer 1

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <string.h>
#define MAX_STR_LEN     80

struct link_node
{
char node_str[ MAX_STR_LEN ];
struct link_node *next;
};

int compare_node( struct link_node *n1, struct link_node *n2 );
struct link_node *add_node( struct link_node *list, struct link_node *node );
void removeNextln(char *s1);
void display_list( struct link_node *head );

//struct link_node *head = (struct link_node*)malloc(sizeof(struct link_node));// Creating the main/first link node

int main()
{
    struct link_node *head = (struct link_node*)malloc(sizeof(struct link_node));
    head->next = NULL;

printf("Please enter strings. When you are done, enter a blank line.\n");
    char input[MAX_STR_LEN];

    fgets(input,MAX_STR_LEN, stdin);
    removeNextln(input);

    strcpy(head->node_str, input); // #1

    while (input[0]!='\0') {

        fgets(input, MAX_STR_LEN, stdin);
        removeNextln(input);
        if (input[0]!='\0') {
            struct link_node *newNode = (struct link_node*)malloc(sizeof(struct link_node));
            strcpy(newNode->node_str,input);

            newNode->next = NULL;

            head = add_node(head,newNode);
        }

    }

    display_list(head);
    free_mem(head);
}

int compare_node(struct link_node *n1, struct link_node *n2) {

    int ret = -99;

    if (strcmp(n1->node_str,n2->node_str)==0) {ret = 0;}
    else if (strcmp(n1->node_str,n2->node_str)>0) {ret = 1;}
    else if (strcmp(n1->node_str,n2->node_str)<0) {ret = -1;}

    //printf("Comparing %s to %s: %d \n", n1->node_str,n2->node_str,ret);

    return ret;
}

struct link_node *add_node(struct link_node *list, struct link_node *node) {

    struct link_node *curNode = list;
    struct link_node *prevNode = list;

    int cont = 1;

    if (compare_node(curNode,node)>0) {

            //printf("Oh no! New input should be above head!");
            char temp[MAX_STR_LEN];
            strcpy(temp,list->node_str);
            strcpy(list->node_str,node->node_str);
            strcpy(node->node_str,temp);
    }

    while (curNode->next != NULL && cont == 1) {
        prevNode = curNode;
        curNode = curNode->next;

        if (compare_node(curNode,node)>0) {
            cont = 0;
        }
    }

    //printf("CurNode: %s, PrevNode: %s\n", curNode->node_str,prevNode->node_str);

    if (cont == 1) {
        //printf("Reached end...");
        curNode->next = node;
    }

    else if (cont == 0) {
        //printf("Found earlier match...");
        //printf("PrevNode: %s", prevNode->node_str);

        node->next = curNode;
        prevNode->next = node;

    }

    return list;
}

void display_list(struct link_node *head) {

    struct link_node *curNode = head;
    while (curNode->next != NULL) {
        printf("%s\n", curNode->node_str);
        curNode = curNode->next;
    }
    printf("%s\n", curNode->node_str);
}

void removeNextln(char *s1) {

    int count;
    for (count = 0; s1[count]!= '\n'; count++);
    s1[count--] ='\0';

}

void free_mem(struct link_node *head) {

    struct link_node *next = head;
    struct link_node *prev = NULL;

    while (next!=NULL) {
        prev = next;
        next = next->next;
        free(prev);
    }

}

sh-4.3$ main Please enter strings. When you are done, enter a blank line ken arnold tony monitel boba fett hoban washburne neil armstrong boba fett hoban washburne ken arnold neil armstrong tony monitel sh-4.39