文章基本信息

标题：Parallel Rank Sort
本地全文：下载
作者：Felician ALECU
期刊名称：Economy Informatics
印刷版ISSN：1582-7941
出版年度：2005
卷号：V
期号：1
出版社：INFOREC Association
摘要：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.
关键词：Parallel and sequential rank sort algorithm; parallel processing; efficiency; complexity;level; big-O notation.