
Who am I?
23 years old, last year Computer Science student at AGH University of Science and Technology. Interested in Java and distributed systems. 
Recent Articles

Categories
 algorithms (4)
 c++ (4)
 coding (18)
 enterprise edition (9)
 java (13)
 operating systems (6)
 other (2)
 snippets (7)
 standard edition (4)
 unix (5)
 windows (1)

Top 8 last month
 [C++] Counting sort: faster than quicksort! (646 views)
 [C++] Radix sort  integers sorting (532 views)
 [Java] Example of Spring IoC (Inversion of Control)  dependency injection (461 views)
 [C++] Convex hull  Graham algorithm (408 views)
 [Java] EclipseLink  getting started (354 views)
 [Java] Spring IoC Container  autowiring (297 views)
 [Java] Unit tests  JUnit vs TestNG (285 views)
 [Java] Fulltext search with Lucene (283 views)
Tag Archives: counting sort
[C++] Radix sort – integers sorting
I have recently written article about counting sort, a linear complexity stable sorting algorithm: C++ counting sort implementation. Now I want to introduce you another fast sorting algorithm – radix sort. It is divided into two parts: one part that … Continue reading
[C++] Counting sort: faster than quicksort!
Probably you know sorting at good level, wrote quicksort and other fast algorithms thousand times. The best sorting algorithms which as main operation have comparing one value to another has O(nlogn) complexity. With the assumption of comparing values they couldn’t … Continue reading