The programming of the data selection algorithms represents an actual challenge. These algorithms are used for pattern recognition. This article describes several sorting methods which uses the sorting networks, and an application which implements them, using Java graphic user interface (GUI) elements. It's about demonstrative applications for bitonicsort method. The sort network is a special form of the sorting algorithm in which the comparison sequence doesn't depend of the sorting data. This makes possible the implementation of quick sort nets in hardware structures, or in parallel processor tables. This article is putting forward one of the best sorting method of in the matter of speed – Bitonic Sort. Because of it's nature it can be implemented in parallel algorithms – the advantage of efficiently using of a multiprocessor server or using be implemented in networks of independent processing knots.