  In the work we discuss the benefit of using bitwise operations in
programming. Some interesting examples in this respect have been shown. What is
described in detail is an algorithm for sorting an integer array with the
substantial use of the bitwise operations. Besides its correctness we strictly
prove that the described algorithm works in time O(n). In the work during the
realisation of each of the examined algorithms we use the apparatus of the
object-oriented programming with the syntax and the semantics of the
programming language C++.
