Shell Sort is an algorithm for sort

Shell Sort is an algorithm for sorting a list of numbers in stages. The algorithm, proposed
by Shell [16], was given in Knuth’s 1973 book [6] and has generated a substantial
literature in the years since (many references are given in Sedgewick [14] and Mahmoud
[10]). Shell Sort is a generalization of insertion sort. It has little overhead and is easy to
implement, and is thus a practical choice for sorting moderate-sized lists. In sorting n
random keys, Shell Sort is able to improve considerably on the
(n2) average running
time of insertion sort (Sedgewick [14] gives detailed results for different parameter
choices.)

ผลลัพธ์ (อังกฤษ) 2:

Shell Sort is an algorithm for sorting a list of numbers in stages. The algorithm, Proposed
by Shell [16], was the 1,973th Given in Knuth's Book [6] and has a substantial Generated
literature in the years since (many references are Given in Sedgewick [14] and Mahmoud
[10]). Shell Sort is a generalization of insertion sort. Has Little overhead and is Easy to
IMPLEMENT, and is thus a practical moderate-sized Choice for Sorting lists. Sorting in n
Random Keys, Shell Sort is Able to improve considerably on the? (N2) average running
time of Insertion sort (Sedgewick [14] gives detailed results for different parameter
Choices.).

ผลลัพธ์ (อังกฤษ) 3:

Shell Sort is an algorithm for sorting a list of numbers in stages. The, algorithm proposed
by Shell [16], was given in. Knuth 's 1973 book [] and 6 has generated a substantial
literature in the years since (many references are given in Sedgewick. [] and 14 Mahmoud
[10]). Shell Sort is a generalization of insertion sort. It has little overhead and is easy, to
implementAnd is thus a practical choice for sorting moderate-sized lists. In sorting n
random keys Shell Sort, is able to improve. Considerably on the
(N2) average running
time of insertion sort (Sedgewick [] gives 14 detailed results for different parameter
choices.).