Own sort algorithm
Input: unsorted array of integers. Output: ordered array of integers. The principle is split set of incoming values into vectors, that only grows. And merge this vectors into one ordered array. Complexy is o(2*n*ln(n)). Effective for sequences, that have little disordered.
I have great experience in system programming and application sofware develpment for win32. Invent new algorithms and apply existent. Develop user interfaces and API's. Can produce OOP or procedural syle code. Little experience in application development under Linux.