Speeding sort algorithms by special instructions

DOI10.1007/BF01934066zbMath0464.68058OpenAlexW2059998517MaRDI QIDQ1154271

Hannu Erkiö

Publication date: 1981

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934066

zbMATH Keywords

performance improvementinternal sortingdynamic microprogramming21, 2-19 (1981)inner loops

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (1)

Making bubblesort recursive

Cites Work

• Unnamed Item
• Insertion merge sorting
• Techniques of Program Execution with a Writable Control Memory
• Dynamic Problem-Oriented Redefinition of Computer Architecture via Microprogramming
• Heuristic Synthesis of Microprogrammed Computer Architecture
• System Design of a Dynamic Microprocessor
• Dynamic microprogramming
• An empirical study of FORTRAN programs

This page was built for publication: Speeding sort algorithms by special instructions