Data Structures and Algorithms: BRIDGES

The assignment is to log the performance of insertion/deletion operations on ArrayLists and LinkedLists. Complete each unfinished function that has a TODO comment. Please provide comments on how your code works. Here is the main file: main.java¹

This project uses the built in ArrayList and LinkedList classes in Java.

You can refer to the ArrayList docs: Here²

You can refer to the LinkedList docs: Here³

Please download this word document: Data_Structure_Operations.docx⁴

Fill out each cell with the BigO worst case runtime complexity of each operation for the given data structure. Also, write a couple sentences describing why each operation is the runtime you have choosen.