let me look at it later.. i know C# and php knows a bit of C++..

...like i said, i wont write the code for you but ill point you in the right direction - i really have no idea where you stand when it comes to cpp so ill try and be as simple as possible

- You should understand what a struct is: struct is one of the structure types in cpp - it can be composed of several differnet types of elements - since you are working with a linked list of struct objects (named element), you should understand that they have to be connected by pointers (thus the element *next as the element of the struct)

- the element *next basically points to the next elemnt in the struct linked list

- you can start our your linked list by saying
element *Head = NULL;             
             this is said to be a dummy node

...now im gonna be nice - you can use the similar code to do the rest of your assignment, its quite simple actually

  void addNode(element **head, int yourInteger) {
    element *tmp;

    if ((tmp = malloc(sizeof(*tmp))) == NULL) {
      ERR_MSG(malloc);
      (void)exit(EXIT_FAILURE);
    }
    tmp->data = yourInteger;
    tmp->next = *head;
    *head = tmp;
  }



- there I noticed that you also need a random integer created - this has an easy solution - since im just trying to be simple, you should do this

create a variable count that keeps track of how many elements you have - every time you want to create a new element, you can pass that variable to a helper method that can take that count variable and lets say add 5 to it and multiply it by 2 (example...you currently have 2 elements in your linked list - you wanna create a 3rd one - pass 2 to the method, method adds 5 to it = 7 and multiply it by 2 - that will equal 14 - there is your randomly generated number)

you can also use the 'time' function of c, which takes the current number of computer clocks to generate a random number - but no need to make it more complicated



to put elements in the right order, you can use any sorting method: bubble sort, merge sort (would be best since you are already working with linked lists), quick sort - you can find algorithms on the web



......i think i coverd the basis - if you have any more questions ask away

to create an element in between - you can simply make another pointer that points to some element in your linked list and in the method i wrote there for you, instead using the head, use the pointer to that new pointer

get what i mean ?

glad to be of help