Bilateral Selectsort Algorithm
Min Jiang
Abstract
Min Jiang
Abstract
Sequence algorithm is always an important part in the teaching of computer algorithm .There are classical sequence algorithms, such as Bubblesort Selectsort, Insertsort, Shellsort and so on . In order to extend the idea of sequence algorithm, the author refers binary searching method and designs a new sequence algorithm on the basis of select sort-bilateral select sort.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Sequence algorithm is always an important part in the teaching of computer algorithm .There are classical sequence algorithms, such as Bubblesort Selectsort, Insertsort, Shellsort and so on . In order to extend the idea of sequence algorithm, the author refers binary searching method and designs a new sequence algorithm on the basis of select sort-bilateral select sort.
Key concepts: Sequence (biology), sort, Algorithm, Computer science, Sorting algorithm, Basis (linear algebra), Mathematics, Sorting