Purchase Solution

Java Split Linked List Into Two Equal Sublists

Not what you're looking for?

Ask Custom Question

See the attachment.

Splitting a Linked List into two sublists of almost equal sizes

Add the method splitMid to the class LinkedListClass as follows:
Public void splitMid(LinkedListClass<T> sublist);
// This method splits the given list into two sublists of almost equal sizes
// Precondition: The list must exist
//Postcondition: first points to the first node, and last points to the last node of the first sublist
// sublist.first points to the first node, and sublist.last points to the
// last node of the second sublist.

Consider the following statements:
UnorderedLinkedList<Integer> myList;
UnorderedLinkedList<Integer> sublist;

Suppose myList points to the list with elements 34, 65, 27, 89, and 12 (in this order). The statement
myList.splitMid(subList);
splits myList into two sublists: myList points to the list with elements 34, 65, and 27. And subList points to the sublist with elements 89 and 12.
Write the definition of the method splitMid. Also write a program to test your method. (Use either the class UnorderedLinkedList or the class OrderedLinkedList to test your method).

Attachments
Purchase this Solution
Solution Summary

The solution discusses the Java split linked list into two equal sublists.

Solution Preview

I have added the method splitMid() to the UnorderedArrayList.java. It is also declared in ...

Purchase this Solution
Free BrainMass Quizzes
Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

C# variables and classes

This quiz contains questions about C# classes and variables.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

View More Free Quizzes
Related BrainMass Solutions

  • Java data structures and alg.

    Use the procedure Cut_In_Two to divide L into two pieces 2. Recursively sort the two pieces 3. Merge the results (use the function written in Question 1a).

  • Sorting in Java

    Answer: Since the pseudo code doesn't contain the merge process, it only divides lists into sublists, which takes log n times, with log base 2; so the time complexity function for this merge sort is O(log2 n). Sorting in Java is emphasized.

  • Java Nearest Neighbor Algorithm

    462332 Java Nearest Neighbor Algorithm Please assist with a java class named "Topology" that includes methods "NearestNeighbor" and "RandomNeighbor".

  • Java MyLinkedList with insertSortNoDuplicate method

    If an element in current list exists in the otherlist then replace (update) it, otherwise insert (add) it using the above insertSortNoDuplicate method. See the attached file. This response works with following type of linked list node.

  • Data Structures Question

    (b) The interface file for a linked list implementation of the Unsorted List ADT offers the following methods: public void make(Object item); public void delete(Object item); public ListReferenceBased concat(ListReferenceBased list2); public ListReferenceBased

  • A client function that merges two instances of the Sorted List ADT

    MergeLists(SortedType list1, SortedType list2,SortedType& result) Function: Merge two sorted lists into a thirdsorted list. Preconditions: list1 and list2 have been initialized and are sorted by key using function ComparedTo.

  • C++ code to implement SplitLists

    An Unsorted Type ADT is to be extended by the addition of function SplitLists, which has the following specifications: SplitLists(UnsortedType list, ItemType item, UnsortedType& list1, UnsortedType& list2) Function: Divides list into two lists according

  • Java - ListMerge

    129549 Java - ListMerge Write a program that merges two ordered-list objects of integers into a single ordered-list object of integers.

  • Do not understand concepts of variables, classes, strings, and especially how to save data for later use when creating a program in java.



    You also need another array or linked list to keep track of the available beds with their id numbers. For each new patient created, you need to check if there are available beds.

View More Related Solutions