Write a method called split that rearranges the elements of a list so that all of the negative values appear before all of the nonnegatives. For example, suppose a variable list stores the values [8, 7, -4, 19, 0, 43, -8, -7, 2]. The call of list.split(); should rearrange the list to put the negatives first: [-4, -8, -7, 8, 7, 19, 0, 43, 2]. It doesnt matter what order the numbers are in, only that the negatives appear before the nonnegatives, so this is only one possible solution. You must solve the problem by rearranging the links of the list, not by swapping data values or creating new nodes. You also may not use auxiliary structures like arrays or ArrayLists to solve this problem.

PLEASE ALSO CREATE A TEST CLIENT TO TEST OUT THE PROGRAM.

Provided Files:

**********************

LinkedIntList.java

**********************

// Class LinkedIntList can be used to store a list of integers.

public class LinkedIntList implements IntList { private ListNode front; // first value in the list

// post: constructs an empty list public LinkedIntList() { front = null; }

// post: returns the current number of elements in the list public int size() { int count = 0; ListNode current = front; while (current != null) { current = current.next; count++; } return count; }

// pre : 0 <= index < size() // post: returns the integer at the given index in the list public int get(int index) { return nodeAt(index).data; }

// post: creates a comma-separated, bracketed version of the list public String toString() { if (front == null) { return "[]"; } else { String result = "[" + front.data; ListNode current = front.next; while (current != null) { result += ", " + current.data; current = current.next; } result += "]"; return result; } }

// post : returns the position of the first occurrence of the given // value (-1 if not found) public int indexOf(int value) { int index = 0; ListNode current = front; while (current != null) { if (current.data == value) { return index; } index++; current = current.next; } return -1; }

// post: appends the given value to the end of the list public void add(int value) { if (front == null) { front = new ListNode(value); } else { ListNode current = front; while (current.next != null) { current = current.next; } current.next = new ListNode(value); } }

// pre: 0 <= index <= size() // post: inserts the given value at the given index public void add(int index, int value) { if (index == 0) { front = new ListNode(value, front); } else { ListNode current = nodeAt(index - 1); current.next = new ListNode(value, current.next); } }

// pre : 0 <= index < size() // post: removes value at the given index public void remove(int index) { if (index == 0) { front = front.next; } else { ListNode current = nodeAt(index - 1); current.next = current.next.next; } }

// pre : 0 <= i < size() // post: returns a reference to the node at the given index private ListNode nodeAt(int index) { ListNode current = front; for (int i = 0; i < index; i++) { current = current.next; } return current; }

}

***************

IntList.java

***************

/* This is the interface definition for the IntList data type */ public interface IntList { public int size(); public int get(int index); public String toString(); public int indexOf(int value); public void add(int value); public void add(int index, int value); public void remove(int index); }

****************

ListNode.java

****************

// ListNode is a class for storing a single node of a linked // list. This node class is for a list of integer values.

public class ListNode { public int data; // data stored in this node public ListNode next; // link to next node in the list

// post: constructs a node with given data and given link public ListNode(int data, ListNode next) { this.data = data; this.next = next; }

// post: constructs a node with given data and null link public ListNode(int data) { this(data, null); }

// post: constructs a node with data 0 and null link public ListNode() { this(0, null); } }