A sorting routine of intermediate size and speed

Marty Ossefort · 1983

In this paper, we consider the problem of sorting a file in a database which is stored on a diskette and is to be processed by a small desk-sized computer. In many applications, such as output applications for a general-purpose database, it is also a requirement that the order of the records on the disk not be changed. There are many ways to accomplish such a sort-on-output.

Read the paper · More papers on PaperTik