87 lines
1.8 KiB
C
87 lines
1.8 KiB
C
// 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;
|
|
}
|
|
}
|