sort algorithm

[′sȯrt ¦al·gə‚rith·əm] (computer science) The methods followed in arranging a set of data items into a sequence according to precise rules.

sort algorithm

A formula used to reorder data into a new sequence. Like all complicated problems, there are many solutions that can achieve the same results, and one sort algorithm can re-sequence data faster than another. In the early 1960s, when magnetic tape was "the" storage medium, the sale of a computer system may have hinged on the sort algorithm, since without direct access capability on disk, every transaction had to be sorted into the sequence of the master files in order to update them. Today, sorting is not quite as conspicuous a process as it used to be; however, reports are still presented in sequential order, and myriad indexes to hard disk data must be maintained in a sequential order.

In-Memory Sorting
Today's considerably larger memories enable many sorts to be performed entirely in memory. However, if there is insufficient memory, a sort program may be able to store data that is partially sorted temporarily on disk and merge that data later into the final sequence. See bubble sort, insertion sort, merge sort, quick sort, selection sort, pigeonhole sort and counting sort.

单词	sort algorithm
释义	sort algorithm sort algorithm [′sȯrt ¦al·gə‚rith·əm] (computer science) The methods followed in arranging a set of data items into a sequence according to precise rules. sort algorithm A formula used to reorder data into a new sequence. Like all complicated problems, there are many solutions that can achieve the same results, and one sort algorithm can re-sequence data faster than another. In the early 1960s, when magnetic tape was "the" storage medium, the sale of a computer system may have hinged on the sort algorithm, since without direct access capability on disk, every transaction had to be sorted into the sequence of the master files in order to update them. Today, sorting is not quite as conspicuous a process as it used to be; however, reports are still presented in sequential order, and myriad indexes to hard disk data must be maintained in a sequential order. In-Memory Sorting Today's considerably larger memories enable many sorts to be performed entirely in memory. However, if there is insufficient memory, a sort program may be able to store data that is partially sorted temporarily on disk and merge that data later into the final sequence. See bubble sort, insertion sort, merge sort, quick sort, selection sort, pigeonhole sort and counting sort.
随便看	middle rio grande conservancy district middle rio grande council of governments middle rio grande development council middle rio grande project middle rio grande valley middle rio grande water assembly middle river middle river aircraft systems middle river middle school middle river regional jail middles middle sacral middle sacral artery middle sacral crest middle sacral lymphatic plexus middle sacral plexus middle sacral veins middle saluda river middle savannah river basin middle saxon middlesborough middlesbrough middlesbrough city learning centre middlesbrough, cleveland middlesbrough early revascularization to limit infarction