摘要：One of the fundamental problems of computer science is ordering a list of items. There are a lot of solutions for this problem, known as sorting algorithms. Some sorting algorithms are simple and intuitive but others are extremely complicated but produce lightening-fast results. The purpose of this paper is to present a parallel bubble sort algorithm that has a linear complexity, much better than the complexity level of the fastest known sequential sorting algorithm.
