Requirements: The fastest feature is the one that you don't implement.
Design: Quicksort may be faster than bubblesort. But it doesn't matter if you have layers of singletons and visitors and decorators and observers.
Requirements: The fastest feature is the one that you don't implement.
Design: Quicksort may be faster than bubblesort. But it doesn't matter if you have layers of singletons and visitors and decorators and observers.