Inventing a new sorting algorithm: a case study

Authors:
Susan M. Merritt;Cecilia Y. Nauck
Affiliations:
Pace University, School of Computer Science and Information Systems, 1 Martine Avenue, White Plains, NY;The Masters School, 49 Clinton Avenue, Dobbs Ferry, NY
Venue:
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
Year:
1990

Citing 2
Cited 3

Efficient and portable combined random number generators

Communications of the ACM
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching

Creation of a new case for LUPSort: ALTERNATING

SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
Average case analysis when merging two ordered lists of different length

ACM SIGCSE Bulletin
Double sorting: testing their sorting skills

Proceedings of the 41st ACM technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract