CutinTwo function for lists

Question

I'm trying to do this CutinTwo function to use in another function called generalsort.
This function takes in a list, and returns 2 lists that are the result of splitting the list that is takin in by the function. I got the base case, but I'm having trouble with the recursive call. My problem is, I'm trying to get a pointer to point to the middle element of the list, so that way I can cut the list in half.
Here is what I have so far:
public void CutInTwo(list L1)
          list L2 = new list();
          if(L1.size == 1)
       return;
       else
                  Node current = L1.head;
                  int temp = L1.size / 2;
                  /*this part is the problem.  I can't figure out how to get to the middle
                of the list.  The temp variable will return the the position where the   
               pointer should be, but lists and integers are not of the same type, so
             how can I find out the middle of a list by using only list variables.   */
        }Thanks

Answer 1

Lol,
yea, it's for an assignment for school. Believe me if I wouldn't have had to write my own list class, I wouldn't have.
This is the actual question I'm working on, if anyone cares to see:
2. QUESTION 1b
Write a function GeneralSort that meets this specification:
     Inputs: a list L, and a procedure CutInTwo that meets the specification below
     Outputs: L' (i.e. L is changed), and two integers: Nc, Njs
     Preconditions: L is defined
     Postconditions: L' is sorted in increasing order. Nc is the total number of times
          two list elements were compared during the sorting process, including the
          comparisons made by the Merge and CutInTwo functions. Njs is the total
          number of join and split operations that were performed during the sorting
          process, including the joins and splits done by the Merge and CutInTwo
          functions.
     GeneralSort must use the "general sorting strategy" (described in detail in class):
     1. Use the procedure CutInTwo to divide L into two pieces
     2. Recursively sort the two pieces
     3. Merge the results (use the function written in Question 1a).
The function CutInTwo meets this specification:
     Input: a list L1
     Outputs: L1' (i.e. L1 is changed), L2 (a list), and two integers, Nc and Njs
     Preconditions: L1 has 2 or more elements
     Postconditions: neither L1' nor L2 is empty, and collectively they contain all the
          elements of L1 (and nothing else). Nc is the number of times two list
          elements were compared during the cut_in_two process. Njs is the total
          number of join and split operations that were performed during the
          CutInTwo process.
right now I'm having some trouble with the syntax for the generalsort recursive call and the merging of the two lists.
If anyone can help me out, that would be great,
Thanks