PART 1:
In this homework, reuse the same scenario of Homework 1 and implement the same system using several implementations of the List abstract data structure.
- You should complete the ArrayList and LinkedList implementations in the textbook.
- You should implement a HybridList class that keeps a LinkedList as a component and the elements stored in the LinkedList are ArrayLists. The number of elements in each ArrayList should be less than MAX_NUMBER. When the number of elements in an ArrayList exceeds MAX_NUMBER a new ArrayList should be generated in the LinkedList. When there is no element in an ArrayList it should be removed from the LinkedList.
Use
- LinkedList in the textbook for information about branches
- ArrayList in the textbook for users of the automation system
- HybridList you implemented for the furnitures PART 2:
Analyze the time complexity (in most appropriate asymptotic notation) of all methods in your implementation of automation system for this homework. Attach the code just before its analysis.
RESTRICTIONS:
- Use ArrayList and LinkedList
- Can be only one main class in project
- Dont use any other third part library

![[Solved] CSE222-Homework 3](https://assignmentchef.com/wp-content/uploads/2022/08/downloadzip.jpg)

![[SOLVED] Cse222 – problem: you are given three sorted arrays a, b, and c each having n numbers. you can assume that you can compare two elements from a∪b∪c in o(1)-time. let k be an integer. design an algorithm that outputs the k-th smallest element of a∪b∪c. the running time of your algorithm must be faster than o(n). try to optimize the running time of your algorithm as much as possible.](https://assignmentchef.com/wp-content/uploads/2022/08/downloadzip-1200x1200.jpg)
Reviews
There are no reviews yet.