The improved main sorting algorithmbased on the inter-destiny

Chengzhi Yang*, Ping Li, Xin Sun, Hongchao Wu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

At present, the quality and the speed of the traditional main sorting algorithm are hard to meet the current complex electronic circumstance at the same time. Aiming at the problem, the inter-destiny is defined, and then the improved main sorting algorithm based on the inter-destiny is given. Furthermore, the algorithm steps and flow are given to meet the project need. The simulation shows that the speed and the efficiency of theimproved algorithms is obvious improved than that of traditional algorithms. This paper can be useful to the sorting performance improvement of the equipments as reference.

Original languageEnglish
Title of host publication2011 IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2011
DOIs
Publication statusPublished - 2011
Event2011 IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2011 - Xi'an, China
Duration: 14 Sept 201116 Sept 2011

Publication series

Name2011 IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2011

Conference

Conference2011 IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2011
Country/TerritoryChina
CityXi'an
Period14/09/1116/09/11

Keywords

  • inter-destiny
  • sorting
  • the main sorting

Fingerprint

Dive into the research topics of 'The improved main sorting algorithmbased on the inter-destiny'. Together they form a unique fingerprint.

Cite this