DMITRII PECHERITSA / 프로필
- 정보
4 년도
경험
|
0
제품
|
0
데몬 버전
|
0
작업
|
0
거래 신호
|
0
구독자
|
trader, programmer
DMITRII PECHERITSA
게재된 코드 introsort - array sorting algorithm
hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance
소셜 네트워크에 공유 · 1
125
DMITRII PECHERITSA
게재된 코드 gnome sort - array sorting algorithm
gnome sort is based on the technique used by the dutch garden gnome
소셜 네트워크에 공유
257
DMITRII PECHERITSA
게재된 코드 insertion sort - array sorting algorithm
a simple sorting algorithm that people use to manually sort cards in a bridge hand
소셜 네트워크에 공유 · 1
130
DMITRII PECHERITSA
게재된 코드 selection sort - array sorting algorithm
an in-place comparison sorting algorithm
소셜 네트워크에 공유
92
DMITRII PECHERITSA
게재된 코드 shell sort - array sorting algorithm
an in-place comparison sort
소셜 네트워크에 공유
136
DMITRII PECHERITSA
게재된 코드 heap sort - array sorting algorithm
a much more efficient version of selection sort
소셜 네트워크에 공유
153
DMITRII PECHERITSA
게재된 코드 merge sort - a merging method comparison-based sorting algorithm
an efficient, general-purpose sorting algorithm
소셜 네트워크에 공유
154
DMITRII PECHERITSA
게재된 코드 quick sort - sorting algorithm
a highly efficient sorting algorithm, based on partitioning of array of data into smaller arrays
소셜 네트워크에 공유
165
DMITRII PECHERITSA
게재된 코드 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
소셜 네트워크에 공유
113
DMITRII PECHERITSA
게재된 코드 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
소셜 네트워크에 공유
170
DMITRII PECHERITSA
게재된 코드 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
214
DMITRII PECHERITSA
게재된 코드 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
155
DMITRII PECHERITSA
게재된 코드 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
106
DMITRII PECHERITSA
게재된 코드 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
소셜 네트워크에 공유
110
DMITRII PECHERITSA
게재된 코드 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
소셜 네트워크에 공유
120
DMITRII PECHERITSA
게재된 코드 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
소셜 네트워크에 공유
123
DMITRII PECHERITSA
게재된 코드 Iterator - behavioral design pattern
Provide a way to access the elements of an aggregate object sequentially without exposing its underlying representation
소셜 네트워크에 공유
121
DMITRII PECHERITSA
게재된 코드 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
소셜 네트워크에 공유
116
DMITRII PECHERITSA
게재된 코드 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
소셜 네트워크에 공유
119
DMITRII PECHERITSA
게재된 코드 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
109
: