Implement simplest algorithm for example, small, medium pizzas

The finish of the Sprint 2

Performance improvements:

• decrease logging verbosity for big arrays
• add optimizations to cutAllStartPostions, to avoid iteration over all array elements by ArrayList.removeAll() method
• implement returning of start positions without available steps to a pizza
• added a custom utility class for simple performance measures

Summarizing:

Slicing of: example, small, medium slices took 10m 39 seconds on a MacBookPro
Results:

• example 6
• small 30
• medium 33037
• big - too long to slicing. Was ran and took about 20 hours.(a desktop PC with an Intel-I54670K)

Simplest working algorithm

The release contains the simplest working algorithm for the pizza slicing problem.

Improvements area for the follow-on release:

1. Fix input for middle and big files. As a suggestion substitute String by a StringBuilder.
2. Debug the algorithm on the middle input.