Programming language and development system : C++ , Microsoft Visual Studio.

Name of developed program : Binary sort in ascending order.

Description of developed program :

A program compares to sort, using binary sort, 1000,2000,3000,4000 and 5000 elements. It generate elements themselves.
Binary sort (eng. insertion sort) – a simple algorithm for sorting.
At each step of the algorithm we choose one element of the input data and insert it into the desired position in the already sorted list, until the set of input data is reached. Selecting the next item selected from the original array, arbitrary, can be used almost any algorithm of choice.
Although this method of sorting is much less effective than more sophisticated algorithms (such as a rapid screening), it has several advantages:

• easy to implement
• effective for small data sets
• effective for data sets that are already partially sorted
• This sorting algorithm is stable (does not change the order of elements that are already sorted)
• can sort the list as it is received

Created (developed) a program written in C + +. Source programs are well established commented.
If you have questions about the source code created by the program, I would be happy to answer them.
Developed (created) the program can be modified for your environment.
You can order the creation of the graphical equivalent of the console program.
You can order the creation (development) programs, software for your job.

Created ( developed ) program written in c++. Source code are well commented.
If you have questions about the source code created by the developed program, I would be happy to answer them.
Developed (created) program can be modified for your environment.
You can order the creation of the graphical equivalent of the console program.
You can order the creation ( development ) programs, software for your tasks.

Programming language and development system : C++ , Microsoft Visual Studio.

Name of developed program : Lexical sort in ascending order.

Description of developed program :

Lexicographic order of sequences suggests that the sequence of A is preceded by a sequence of B, if for some S of the initial segments of length equal to S and S + 1 st member of the sequence smaller than A.
Examples of lexicographic order:

• sequence of numbers in a notation written in the fixed-bit grid (000, 001, 002, 003, 004, 005, …, 999)
• order of words in the dictionary. It is anticipated that the letters can be compared by comparing their numbers in the alphabet. Then the lexicographic order – this is for example the AAA, AAB, AAV, AAG …, YAYAYA.

Created (developed) a program written in C + +. Source programs are well established commented.
If you have questions about the source code created by the program, I would be happy to answer them.
Developed (created) the program can be modified for your environment.
You can order the creation of the graphical equivalent of the console program.
You can order the creation (development) programs, software for your job.

Created ( developed ) program written in c++. Source code are well commented.
If you have questions about the source code created by the developed program, I would be happy to answer them.
Developed (created) program can be modified for your environment.
You can order the creation of the graphical equivalent of the console program.
You can order the creation ( development ) programs, software for your tasks.

Programming language and development system : C++ , Microsoft Visual Studio.

Name of developed program : Pyramid sort in ascending order.

Description of developed program :

Pyramid sort – sorting algorithm that runs in worst, average and best case (i.e., guaranteed) for the O(n log n) operations when sorting n elements. Number of used memory performance does not depend on the size of the array (i.e., O(1)).

Pyramid sort uses a sorted tree.
Sorted tree is a binary tree, which has fulfilled the conditions:
Each leaf has a depth of either d or d – 1, d – the maximum depth of the tree.
The value of any vertex more than the value of its offspring.

Created ( developed ) program written in c++. Source code are well commented.
If you have questions about the source code created by the developed program, I would be happy to answer them.
Developed (created) program can be modified for your environment.
You can order the creation of the graphical equivalent of the console program.
You can order the creation ( development ) programs, software for your tasks.

Programming language and development system : C++ , Microsoft Visual Studio.

Name of developed program : Shell sort in ascending order.

Description of developed program :

Shell sort – sorting algorithm, the idea is to compare the elements, facing not only the number, but at a distance from each other.
First the keys of shell sort are compared and sorted, separated from one another at a distance d. After this procedure is repeated for some smaller values of d, and shell sort finishes ordering of elements in the d = 1 (i.e, the normal sorting insertions. The effectiveness of shell sorting, in certain cases, provided that the elements of a “faster” stand on their seats (in simple methods or bubble sort, each permutation of two elements reduces the number of inversions in the list up to a maximum of 1, when shell sorting this number may be higher).

Created ( developed ) program written in c++. Source code are well commented.
If you have questions about the source code created by the developed program, I would be happy to answer them.
Developed (created) program can be modified for your environment.
You can order the creation of the graphical equivalent of the console program.
You can order the creation ( development ) programs, software for your tasks.