This paper describes the design and analysis of the architecture and the algorithms of a novel sorting engine-SORTER based on so called"Negative Memory"concept.Without performing any comparison

this SORTER avoids the O（n log n） lower bound constraint on ordinary sorting algorithms.SORTER uses only read and write

the two basic operations

to perform elements sorting.In terms of the number of memory access

SORTER achieves the complexity of O（n）.In addition

using the fundamental sorting algorithm with slight modifications

SORTER can also be used for majority of database operations with complexity O（n）.