DMITRII PECHERITSA
DMITRII PECHERITSA
  • Informações
4 anos
experiência
0
produtos
0
versão demo
0
trabalhos
0
sinais
0
assinantes
trader, programmer
DMITRII PECHERITSA
Publicado o código introsort - array sorting algorithm
hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance
1 128
DMITRII PECHERITSA
Publicado o código gnome sort - array sorting algorithm
gnome sort is based on the technique used by the dutch garden gnome
260
DMITRII PECHERITSA
Publicado o código insertion sort - array sorting algorithm
a simple sorting algorithm that people use to manually sort cards in a bridge hand
1 133
DMITRII PECHERITSA
Publicado o código selection sort - array sorting algorithm
an in-place comparison sorting algorithm
95
DMITRII PECHERITSA
Publicado o código shell sort - array sorting algorithm
an in-place comparison sort
138
DMITRII PECHERITSA
Publicado o código heap sort - array sorting algorithm
a much more efficient version of selection sort
157
DMITRII PECHERITSA
Publicado o código merge sort - a merging method comparison-based sorting algorithm
an efficient, general-purpose sorting algorithm
156
DMITRII PECHERITSA
Publicado o código quick sort - sorting algorithm
a highly efficient sorting algorithm, based on partitioning of array of data into smaller arrays
168
DMITRII PECHERITSA
Publicado o código visitor - behavioral design pattern
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
117
DMITRII PECHERITSA
Publicado o código template method - behavioral design pattern
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
174
DMITRII PECHERITSA
Publicado o código strategy - behavioral design pattern
define a family of algorithms, encapsulate each one, and make them interchangeable. strategy lets the algorithm vary independently from clients that use it
1 217
DMITRII PECHERITSA
Publicado o código state - behavioral design pattern
allow an object to alter its behavior when its internal state changes. the object will appear to change its class
1 157
DMITRII PECHERITSA
Publicado o código observer (pull model) - behavioral design pattern
define a one-to-many dependency between objects so that when one object changes state, all its dependents are notified and updated automatically
2 108
DMITRII PECHERITSA
Publicado o código observer (push) - behavioral design pattern
define a one-to-many dependency between objects so that when one object changes state, all its dependents are notified and updated automatically
111
DMITRII PECHERITSA
Publicado o código Memento - behavioral design pattern
without violating encapsulation, capture and externalize an object's internal state so that the object can be restored to this state later
123
DMITRII PECHERITSA
Publicado o código Mediator - behavioral design pattern
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
127
DMITRII PECHERITSA
Publicado o código Iterator - behavioral design pattern
Provide a way to access the elements of an aggregate object sequentially without exposing its underlying representation
123
DMITRII PECHERITSA
Publicado o código Interpreter - behavioral design pattern
Given a language, define a represention for its grammar along with an interpreter that uses the representation to interpret sentences in the language
122
DMITRII PECHERITSA
Publicado o código Command - behavioral design pattern
Encapsulate a request as an object thereby letting you parameterize clients with different requests. Queue or log requests, and support undoable operations
122
DMITRII PECHERITSA
Publicado o código Chain of responsibility - behavioral design pattern
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
2 113
123