Browse Prior Art Database

Effective sort algorithm for partially sorted data array

IP.com Disclosure Number: IPCOM000021457D
Original Publication Date: 2004-Jan-20
Included in the Prior Art Database: 2004-Jan-20

Publishing Venue

IBM

Abstract

This disclosure describes a effective sort algorithm for partially sorted data array with following characteristics: (1) Input data array consists of more than one sorted data blocks. (2) Each data structure consists of more than one sort key, and the data block is sorted by the 1st key, but not always sorted by the other keys. (3) Most data can be identified by the 1st key without duplication. In most application system, the standard sort algorithm, such as merge-sort, quick-sort, etc., could be considered for the solution. However, the time critical system, like Monte Carlo simulation, requires the high performance sort algorithm like the technique described in this article.