# The bitwise operations related to a fast sorting algorithm

arXiv: https://arxiv.org/abs/1312.0138 · HTML: https://mlsanity.com/paper/1312.0138/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Nov 2013.

## Built on by (most cited first, 1 of 1)

- [Fast and Compact Tsetlin Machine Inference on CPUs Using Instruction-Level Optimization](https://mlsanity.com/paper/2510.15653/) (2025)

## Abstract (arXiv)

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++.