Titlebook: Sorting Routines for Microcomputers; Keith McLuckie,Angus Barber Textbook 1986Latest edition Keith McLuckie and Angus Barber 1986 computer

存貨清單

書目名稱Sorting Routines for Microcomputers影響因子(影響力)




書目名稱Sorting Routines for Microcomputers影響因子(影響力)學(xué)科排名




書目名稱Sorting Routines for Microcomputers網(wǎng)絡(luò)公開度




書目名稱Sorting Routines for Microcomputers網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Sorting Routines for Microcomputers被引頻次




書目名稱Sorting Routines for Microcomputers被引頻次學(xué)科排名




書目名稱Sorting Routines for Microcomputers年度引用




書目名稱Sorting Routines for Microcomputers年度引用學(xué)科排名




書目名稱Sorting Routines for Microcomputers讀者反饋




書目名稱Sorting Routines for Microcomputers讀者反饋學(xué)科排名

CESS

Noctambulant

Influx

Binary Tree Sort,inear succession of elements. By treating the input list as non-linear it is possible to cut down on the number of comparisons and exchanges that need to be carried out to sort. Non-linear in this instance means that the list is accessed non-sequentially, that is not one item after another, necessarily.

Intentional

Binary Tree Sort,peeds their sort times will always be dependent on n ~2 and this has made some of them extremely slow and hence of little use for any large values of n. The next few chapters cover several sorts that impose a structure on the input list. As a result of this structure the lists are treated as a non-l

CON

Quicksort,3, 64, 65 in the Communications of the Association o f Computing Machinery (CACM). The original article contained many ideas on improving the Quicksort and these speculations have been responsible for a number of variations on Hoare’s Quicksort. Like Shellsort, Quicksort is now a generic name for a

avulsion

Sorting by Insertion,is and the next chapter will not improve upon the time achieved by the Quicksort but will demonstrate other methods of sorting, possibly not as obvious as the exchange and counting techniques already demonstrated. Although the sorts may not be faster, they do have advantages associated with them tha

WAG

Relative Merits,n writing this book we had no intention of running a competition to find the fastest sort, although that is how it appears to have ended up! The idea of the QQ Sort and its hybrid also developed during the course of writing.

Eulogy

Merges, a minor way here. It is well within the bounds of possibility that, at some time, a programmer using a small computer is going to wish to form one file from several (for example, when sorting a large number of elements) and merging will permit this. Merges are generally external methods but they ca

樹木心