DMITRII PECHERITSA / Profilo

hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance

gnome sort is based on the technique used by the dutch garden gnome

a simple sorting algorithm that people use to manually sort cards in a bridge hand

an in-place comparison sorting algorithm

an in-place comparison sort

a much more efficient version of selection sort

an efficient, general-purpose sorting algorithm

a highly efficient sorting algorithm, based on partitioning of array of data into smaller arrays

represent an operation to be performed on the elements of an object structure. visitor lets you define a new operation without changing the classes of the elements on which it operates

define the skeleton of an algorithm in an operation, deferring some steps to subclasses. template method lets subclasses redefine certain steps of an algorithm without changing the algorithm's structure

define a family of algorithms, encapsulate each one, and make them interchangeable. strategy lets the algorithm vary independently from clients that use it

allow an object to alter its behavior when its internal state changes. the object will appear to change its class

define a one-to-many dependency between objects so that when one object changes state, all its dependents are notified and updated automatically

define a one-to-many dependency between objects so that when one object changes state, all its dependents are notified and updated automatically

without violating encapsulation, capture and externalize an object's internal state so that the object can be restored to this state later

Define an object that encapsulates how a set of objects interact mediator promotes loose coupling by keeping objects from referring to each other explicitly, and it lets you vary their interaction independently

Provide a way to access the elements of an aggregate object sequentially without exposing its underlying representation

Given a language, define a represention for its grammar along with an interpreter that uses the representation to interpret sentences in the language

Encapsulate a request as an object thereby letting you parameterize clients with different requests. Queue or log requests, and support undoable operations

Avoid coupling the sender of a request to its receiver by giving more than one object a chance to handle the request. Chain the receiving objects and pass the request along the chain until an object handles it