My Lonely Island – Niijima Coast at Sundown

by Sprengben [why not get a friend]
hit “L” for a more spectacular view!

If you could take three things to a lonely Island, what would it be?

For me it would definitely not be my computer 🙂 The cool thing about traveling is that you somehow get rid of all the media (Even though I like to be inspired by good music when I shot my photos).
It is like a blessing to not have all these media inputs. Therefor you are able to feel this world with different senses. If you aren’t connected to Facebook, Twitter and Flickr all the time you don’t need to care about these pages anymore.

So yes I think I would take a book, my guitar and a bunch of nice people with whom I would like to talk about all these deep things you can’t talk about when you are in your daily crazy rush.

If you look at this photo I recommend to get lost in this really nice song called “Lift Me Up” by MOBY.

Moby – Lift Me Up

Somehow the song and especially the whole Hotel Album has always been a welcome follower of me taking pictures. Why? Because the music is somehow empty like this image but still so beautiful and thoughtful at the same time!

The Spot you see here is the lovely Island called Niijima. You can find it six hours away from Tokyo somewhere in midst of the Pacific.

Have a perfect weekend everybody!


| Facebook | Fluidr-Interesting | Flickr Hive Mind | DNA | Blog | Twitter | Tumblr |
on Flickr. Original here.


Four B&W

by Brian Hammonds
Captured in Göreme, Turkey.

ArrayList vs LinkedList [java]

Today I was reviewing the Collection’s chapter for the SCJP (Sun Certified Java Programmer) and for the sake of understanding, I started playing around with ArrayList and LinkedList implementation of the java.lang.List interface. I was curious about the differences (here an interesting post) and I wrote a small piece of code to measure the time needed to perform some basic operations: add(), get(), contains(), remove().

package collection;

import java.util.*;

 * Created with IntelliJ IDEA.
 * User: lfoppiano
 * Date: 14/10/12
 * Time: 16:37
 * To change this template use File | Settings | File Templates.
public class ListTest {

    private static final int NUMBER_OF_ELEMENTS = 1000000;

    public static void main(String... args) {

        List arrayList = new ArrayList();
        System.out.println("Array list benchmark");

        BenchmarkList benchmarkList = new BenchmarkList(arrayList, NUMBER_OF_ELEMENTS);

        List linkedList = new LinkedList();
        System.out.println("Linkedlist benchmark");

        benchmarkList = new BenchmarkList(linkedList, NUMBER_OF_ELEMENTS);

class BenchmarkList {

    private List target;
    private Integer numberOfElements;

    BenchmarkList(List target) { = target;

    BenchmarkList(List target, Integer numberOfElements) {
        this.numberOfElements = numberOfElements;

    public void runAddTest() {
        long start = System.currentTimeMillis();
        for (int x = 0; x < numberOfElements; x++)

        long end = System.currentTimeMillis();
        System.out.println("Insert of " + numberOfElements + " elements: " + (end - start) + " ms");


    public void runRemoveTest() {
        long start = System.currentTimeMillis();


        long end = System.currentTimeMillis();
        System.out.println("Remove of " + numberOfElements + " elements: " + (end - start) + " ms");

    public void runAccessTest() {
        long start = System.currentTimeMillis();
        for (int x = 0; x < numberOfElements; x++)

        long end = System.currentTimeMillis();
        System.out.println("Access of " + numberOfElements + " elements: " + (end - start) + " ms");

    public void runContainsTest() {
        long start = System.currentTimeMillis();

        long end = System.currentTimeMillis();
        System.out.println("Contains of " + numberOfElements + " elements: " + (end - start) + " ms");

    public void runAllTests() {

And this is the result with a case of 100, 1000, 10000 and 100000 elements:

Some comments:

  • ArrayList are fast to iterate to random access the data (get() an element). adding or removing element are more expensive, because, for the nature of an Array, the elements needs to be reorganized.
  • LinkedList are faster to add() and remove() because every element is linked to the following and the previous. The access is double penalized because there is no index as in the ArrayList, but to get to the element it is required to iterate the entire list.
  • ArrayList are 90% of the cases good enough, however for heavy duty operations of insertion and removal, LinkedList is a more appropriate choice. I must say that the gain on the insert/remove is counterbalanced by a huge penalty on random access, therefore the usage of LinkedList should be carefully verified, to avoid bad surprises.
  • Accessing elements with an Iterator bring benefit only on LinkedList, on the other hand, we are not talking anymore about random access.