Now, let’s see the code for measuring how ArrayList and LinkedList behave when we need to add at the void add_start()ĪrrayListVsLinkedListAdditionStartTest.class The complexity of this operation is O(n).In the worst case, we need to move from the head/tail to the index (n/2).Changing references from 5 number and 9 number to the new node: Changing references to insert new node List.add(list.size() / 2, executionPlan.element) ģ. Now, let’s see the code for measuring how ArrayList and LinkedList behave when we need to add at the void add_middle()ĪrrayListVsLinkedListAdditionMiddleTest.class The size limit here is defined by your JVM memory, there is no other restriction.
The complexity of this operation is O(1). We only need to create a new node and linked to the tail. TRY IT YOURSELF: You can find this source code here. LinkedList list = executionPlan.linkedList Return = Utils.amountIterations, batchSize = 1, time = LinkedList linkedList( Result linkedListResult = Utils.amountIterations, batchSize = 1, time = ArrayList arrayList(ĪrrayList list = executionPlan.arrayList Now, let’s see the code for measuring how ArrayList and LinkedList behave when we need to add at the void add_end()ĪrrayListVsLinkedListAdditionEndTest.class In that way, we guarantee we are measuring the same scenario. As JMH doesn’t allow sharing data between benchmarks, we are going to create a file with the list of elements, and read from it by each benchmark. We are going to use a list of 10.000.000 of elements, generated randomly, and we are going to calculate the average response time in 10 iterations. We are going to use JMH for the micro benchmark. Graphics Intel® HD Graphics 620 (Kaby Lake GT2). Processor Intel® Core™ i7-7500U CPU 2.70GHz × 4. Part 4: ArrayList vs LinkedList: Sort, Get and Iteration. Part 3: ArrayList vs LinkedList: Deletion. Part 2: ArrayList vs LinkedList: Addition (You are here). TRY IT YOURSELF: You can find the source code of this post here. 
In this post, we are going to compare ArrayList and LinkedList performance using addition operations. In previous post, we introduced this List collection and some implementations like LinkedList and ArrayList.
0 kommentar(er)
