Last active
March 10, 2018 11:22
-
-
Save FedericoPonzi/946349da24d370fcb5945945842cce86 to your computer and use it in GitHub Desktop.
This is a benchmark based on this article: https://www.linkedin.com/pulse/performance-array-vs-linked-list-modern-computers-dat-hoang-tien
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import java.util.ArrayList; | |
import java.util.LinkedList; | |
import java.util.Random; | |
/** | |
* Created by Federico Ponzi on 19/02/17. | |
* https://www.linkedin.com/pulse/performance-array-vs-linked-list-modern-computers-dat-hoang-tien | |
*/ | |
public class Benchmark | |
{ | |
private int size; | |
ArrayList<Integer> arrayList; | |
LinkedList<Integer> linkedList; | |
long start; | |
long arrayTime; | |
long dequeTime; | |
Random random; | |
int r; | |
public Benchmark(int size){ | |
this.size = size; | |
random = new Random(); | |
arrayList = new ArrayList<>(); | |
linkedList = new LinkedList<>(); | |
} | |
public void doInitStructures(){ | |
r = random.nextInt(10); | |
start = System.currentTimeMillis(); | |
for (int i = 0; i < size; i++) | |
{ | |
arrayList.add(i+r); | |
} | |
arrayTime = System.currentTimeMillis()-start; | |
start = System.currentTimeMillis(); | |
for (int i = 0; i < size; i++) | |
{ | |
linkedList.add(i+r); | |
} | |
dequeTime = System.currentTimeMillis()-start; | |
System.out.println("Creation( " + size + "): ArrayList time: " + arrayTime + "ms vs LinkedList time:" + dequeTime + "ms"); | |
arrayList = new ArrayList<>(); | |
linkedList = new LinkedList<>(); | |
} | |
/** | |
* Add size elements in first position. | |
*/ | |
public void doAddFirst(){ | |
r = random.nextInt(10); | |
start = System.currentTimeMillis(); | |
for (int i = 0; i < size; i++) | |
{ | |
arrayList.add(0, i+r); | |
} | |
arrayTime = System.currentTimeMillis()-start; | |
start = System.currentTimeMillis(); | |
for (int i = 0; i < size; i++) | |
{ | |
linkedList.addFirst(i+r); | |
} | |
dequeTime = System.currentTimeMillis() - start; | |
System.out.println("AddFirst( " + size + "): ArrayList: " + arrayTime + "ms vs LinkedList:" + dequeTime + "ms"); | |
arrayList = new ArrayList<>(); | |
linkedList = new LinkedList<>(); | |
} | |
public void doRandomInsert(){ | |
r = random.nextInt(10); | |
start = System.currentTimeMillis(); | |
arrayList.add(r); | |
arrayList.add(r); | |
for (int i = 0; i < size; i++) | |
{ | |
arrayList.add(random.nextInt(arrayList.size()-1),i+r); | |
} | |
arrayTime = System.currentTimeMillis()-start; | |
start = System.currentTimeMillis(); | |
linkedList.add(r); | |
linkedList.add(r); | |
for (int i = 0; i < size; i++) | |
{ | |
linkedList.add(random.nextInt(linkedList.size() -1), i + r); | |
} | |
dequeTime = System.currentTimeMillis() - start; | |
System.out.println("RandomInsert( " + size + "): ArrayList: " + arrayTime + "ms vs LinkedList:" + dequeTime + "ms"); | |
//arrayList = new ArrayList<>(); | |
//linkedList = new LinkedList<>(); | |
} | |
public void doRandomRemove() | |
{ | |
r = random.nextInt(10); | |
for (int i = 0; i < size; i++){ | |
r = random.nextInt(10); | |
arrayList.add(r); | |
linkedList.add(r); | |
} | |
start = System.currentTimeMillis(); | |
arrayList.add(r); | |
arrayList.add(r); | |
for (int i = 0; i < size; i++) | |
{ | |
arrayList.remove(random.nextInt(arrayList.size()-1)); | |
} | |
arrayTime = System.currentTimeMillis()-start; | |
start = System.currentTimeMillis(); | |
linkedList.add(r); | |
linkedList.add(r); | |
for (int i = 0; i < size; i++) | |
{ | |
linkedList.remove(random.nextInt(linkedList.size() -1)); | |
} | |
dequeTime = System.currentTimeMillis() - start; | |
System.out.println("RandomRemove( " + size + "): ArrayList: " + arrayTime + "ms vs LinkedList:" + dequeTime + "ms"); | |
arrayList = new ArrayList<>(); | |
linkedList = new LinkedList<>(); | |
} | |
public static void main(String[] args) throws InterruptedException | |
{ | |
ArrayList<Benchmark> benchmarks = new ArrayList<>(); | |
for(int i = 3; i < 6; i++) | |
{ | |
benchmarks.add(new Benchmark((int) Math.pow(10, i) )); | |
} | |
for(Benchmark b : benchmarks) | |
{ | |
b.doInitStructures(); | |
} | |
for(Benchmark b : benchmarks) | |
{ | |
b.doAddFirst(); | |
} | |
for(Benchmark b : benchmarks) | |
{ | |
b.doRandomInsert(); | |
} | |
for(Benchmark b : benchmarks) | |
{ | |
b.doRandomRemove(); | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
This is an example run on my laptop: