Internal sort process

Abstract

Abstract A NOVEL INTERNAL SORT PROCESS IS PRESENTED WHEREBY, IF THE PRIMARY STORAGE AREA MADE AVAILABLE FOR THE SORT HAS THE VALUE LL, THERE CAN BE UTILIZED A SECONDARY STORAGE AREA HVING THE VALUE RXLL IN CARRYING OUT THE SORT. GIVEN AN INPUT SEQUENCE OF RECORDS TO BE SORTED, THE TERM LL DENOTES THE NUMBER OF RECORDS WHICH CAN BE ACCOMMODATED IN THE AVAILABLE PRIMARY STORAGE AREA AND THE TERM R IS A MULTIPLIER OF LL WHICH CAN BE SELECTED BY THE USER. IN THE PROCESS THE SECONDARY STORAGE AREA OF CAPACITY RXLL RECORDS IS EMPLOYED TO FORM A REJECT LIST. THE REJECT LIST RECEIVES, IN ORDER, THOSE ITEMS IN THE INPUT SEQUENCE THAT ARE SMALLER THAN THE ITEMS CURRENTLY IN PRIMARY STORAGE UP TO ITS CAPACITY OF RXLL. THEN, WHEN THE CURRENT OUTPUT STRING CAN NO LONGER BE EXTENDED, THE ITEMS IN THE REJECT LIST ARE FIRST PROCESSED AT THE INCEPTION OF THE FORMATION OF THE NEXT OUTPUT STRING BEFORE THE NEXT ITEMS IN THE INPUT SEQUENCE ARE CONSIDERED. THIS LATTER STAGE OF THE PROCESS WILL RESULT IN RE-EJECTED ITEMS, BUT THEY EVENTUALLY WILL FIND THEIR WAY TO AN OUTPUT STRING. ACCORDINGLY, WITH THIS PROCESS, THERE IS ENABLED THE PRODUCTION OF STRINGS WHOSE LENGTHS CAN BE THEREBY THE PROTHE DEGREE OF INCREASE BEING DEPENDENT UPON THE SELECTION OF THE VALUE OF THE TERM R.

Inventors

No inventors recorded.

Bibliographic Details