#include <stdlib.h>
#include "list.h"

int size = 0;

int main()

{
    return 0;
}

void append(list_item* head, int x)//puts x at the end of the list

     //list_item* my_item ;//the new item
{
    list_item* my_item ;//the new item
    my_item = (list_item*) (malloc)(sizeof(list_item));
    my_item -> value = x;

    if (size != 0) {
        list_item* read_head = head;
        while(read_head -> next != NULL) read_head++;//move my_item_head until we reach the last element..my_item_head now points to the last element
        (read_head -> next) = my_item;    
        my_item -> next = NULL;
        size++;
        return;
    }

    else {//the list is empty
        (head -> next) = my_item;
        my_item -> next = NULL;
        size++;
        return;
    }
}

void prepend(list_item* head, int x)//head of the list

{
    list_item* my_item ;//the new item
    my_item = (list_item*) (malloc)(sizeof(list_item));
    my_item -> value = x;

    my_item -> next = head -> next;
    head -> next = my_item;
    size++;
    return;
}

void print(list_item* head)//print the list

{
    list_item* printhead;
    printhead = head -> next;

    while (size != 0)
    //    if (printhead -> next != NULL) printf("element no. %d = %d
        for  (int i = 0;i <= size;i++) {
            printf("element no. %d = %d\n",i,printhead -> value);
            printhead = printhead -> next;
            return;
        }
    puts("nothing to print, list empty");
    return;
}

void input_sorted(list_item* head,int x)//find the first element in the list thats larger than x and put x right b4 it

{
    list_item* myitem;
    list_item* read_head;
    myitem = (list_item*)malloc(sizeof(list_item));
    myitem -> value = x;

    read_head = head -> next;//the first element in the list

    if((read_head -> next) != NULL) {
        while(((read_head -> next) -> value) <= x) {   
            read_head = read_head -> next;//navigate to the element which precedes the required element so we can insert x after this element
            if (read_head == NULL) {
                puts("there is no such element in the list");
                return;
            }
            else {
                myitem -> next = read_head -> next;
                read_head -> next = myitem;
                size++;
                return;
            }
        }
    }
    else {
        puts("there is no element in the list");
        return;
    }
}

void destroy(list_item* head)

{
    list_item* read_head = head;
    list_item* temp;
    while((read_head -> next) != NULL) {
        temp = read_head -> next;
        free(read_head);
        read_head = temp;
    }
    return;
}

#include <stdio.h>

    typedef struct list_item_ {
        int value;
        struct list_item *next;
    } list_item;

list_item* head;//head points to the first element in the list.
head->value = -1;
//list_item* tail;//tail is the end of the list.

void append(list_item*, int);//puts x at the end of the list
void prepend(list_item*, int);//head of the list
void print(list_item*);//print the list
void input_sorted(list_item*,int);//find the first element in the list thats larger than x and put x right b4 it
void destroy(list_item*);

list_item* item = head;
while( item->next != 0 )
{
    item = item->next;
} // now item points to the last item in the list

    typedef struct list_item_ {
        int value;
        struct list_item_ *next;
    } list_item;

    typedef struct list_item {
        int value;
        struct list_item *next;
    } list_item;

#include <stdlib.h>
#include "list.h"

int size = 0;

int main()

{
    return 0;
}

void append(list_item* head, int x)//puts x at the end of the list

     //list_item* my_item ;//the new item
{
    list_item* my_item ;//the new item
    my_item = (list_item*) (malloc)(sizeof(list_item));
    my_item -> value = x;

    if (size != 0) {
        list_item* read_head = head;
        while(read_head -> next != NULL) read_head++;//move my_item_head until we reach the last element..my_item_head now points to the last element

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

typedef struct list_item_ {
  int value;
  struct list_item_ *next;
} list_item;

void append(list_item** head, unsigned int *size, int x);
void freeallocs(list_item* head);

int main(void)
{
  list_item* head = NULL;
  unsigned int i, c, size;
  i = c = size = 0;

  while( c != 'q') {
    printf("\nMenu: (a)ppend , (q)uit   Choice: ");
    c = getchar();
    getchar();      /* cheap cleanup of  \n */

    switch(c) {
      case 'A':
      case 'a':
        printf("You selected append... automatically allocating 5 nodes:\n");
        i=0;
        for( i = 0; i < 5; i++) {
          printf("head= %p \n", (void*)head);
          append(&head, &size, i);
          printf("    head= %p  size= %u  &size= %p \n                ---end loop %d---\n", (void*)head, size, (void*)&size, i );
        }
        break;

      case 'Q':
      case 'q':
        freeallocs(head);
        break;
    }
  }
  printf(" Does it work??? \n");
  getchar();

  return 0;
}
/********************************************************************/
void append(list_item** head, unsigned int *size, int x)
{
  list_item*  newnode;

  newnode = (list_item*)(malloc(sizeof(list_item)) );
  newnode -> value = x;            /* place the value passed from call */
  (newnode->next) = *head;
  *head = newnode;
  /* *size++;          this increments the pointer! haha */
  *size += 1;

  /* test prints: */
  printf("  size= %p  *size= %u \n", (void*)size, *size );
  printf("  *size= %u   newnode= %p,   newnode->next= %p,   head= %p \n", *size, (void*)newnode, (void*)newnode->next, (void*)*head);

  return;
}
/*******************************************************************/
void freeallocs(list_item* head)
{
  list_item* tmp;

  do {
    tmp = head->next;
    printf(" free()ing: head= %p \n", (void*)head);
    free(head);
    head = head->next;
  }
  while(tmp != NULL);
}