DMITRII PECHERITSA
DMITRII PECHERITSA
  • Information
6+ Jahre
Erfahrung
0
Produkte
0
Demoversionen
0
Jobs
0
Signale
0
Abonnenten
trader, programmer
DMITRII PECHERITSA
Hat den Code introsort - array sorting algorithm veröffentlicht
hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance
1 277
DMITRII PECHERITSA
Hat den Code gnome sort - array sorting algorithm veröffentlicht
gnome sort is based on the technique used by the dutch garden gnome
398
DMITRII PECHERITSA
Hat den Code insertion sort - array sorting algorithm veröffentlicht
a simple sorting algorithm that people use to manually sort cards in a bridge hand
1 257
DMITRII PECHERITSA
Hat den Code selection sort - array sorting algorithm veröffentlicht
an in-place comparison sorting algorithm
206
DMITRII PECHERITSA
Hat den Code shell sort - array sorting algorithm veröffentlicht
an in-place comparison sort
239
DMITRII PECHERITSA
Hat den Code heap sort - array sorting algorithm veröffentlicht
a much more efficient version of selection sort
265
DMITRII PECHERITSA
Hat den Code merge sort - a merging method comparison-based sorting algorithm veröffentlicht
an efficient, general-purpose sorting algorithm
264
DMITRII PECHERITSA
Hat den Code quick sort - sorting algorithm veröffentlicht
a highly efficient sorting algorithm, based on partitioning of array of data into smaller arrays
308
DMITRII PECHERITSA
Hat den Code visitor - behavioral design pattern veröffentlicht
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
263
DMITRII PECHERITSA
Hat den Code template method - behavioral design pattern veröffentlicht
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
300
DMITRII PECHERITSA
Hat den Code strategy - behavioral design pattern veröffentlicht
define a family of algorithms, encapsulate each one, and make them interchangeable. strategy lets the algorithm vary independently from clients that use it
1 344
DMITRII PECHERITSA
Hat den Code state - behavioral design pattern veröffentlicht
allow an object to alter its behavior when its internal state changes. the object will appear to change its class
1 278
DMITRII PECHERITSA
Hat den Code observer (pull model) - behavioral design pattern veröffentlicht
define a one-to-many dependency between objects so that when one object changes state, all its dependents are notified and updated automatically
2 234
DMITRII PECHERITSA
Hat den Code observer (push) - behavioral design pattern veröffentlicht
define a one-to-many dependency between objects so that when one object changes state, all its dependents are notified and updated automatically
226
DMITRII PECHERITSA
Hat den Code Memento - behavioral design pattern veröffentlicht
without violating encapsulation, capture and externalize an object's internal state so that the object can be restored to this state later
219
DMITRII PECHERITSA
Hat den Code Mediator - behavioral design pattern veröffentlicht
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
216
DMITRII PECHERITSA
Hat den Code Iterator - behavioral design pattern veröffentlicht
Provide a way to access the elements of an aggregate object sequentially without exposing its underlying representation
234
DMITRII PECHERITSA
Hat den Code Interpreter - behavioral design pattern veröffentlicht
Given a language, define a represention for its grammar along with an interpreter that uses the representation to interpret sentences in the language
225
123