2008•Journal of Dezhou UniversityRequires access

Design and Analysis of the New Self-indexed Sort Algorithm

Fuxian Huang

Abstract

A new self-indexed sort algorithm is proposed based on study of self-indexed sort algorithm with optimum data processing method,the new algorithm ideas、algorithm description and analysis is given,space complexity of the new sot algorithm is,efficiency of the new algorithm is increasing better than self-indexed sort algorithm along with more and more data sorted.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: sort, Computer science, Algorithm, Sorting algorithm, Ramer–Douglas–Peucker algorithm, Computation, Information retrieval