Shellsort
In-place comparison sorting algorithm invented by D. Shell
Shellsort, also known as Shell sort or Shell's method, is an in-place comparison sort. It can be understood as either a generalization of sorting by exchange (bubble sort) or sorting by insertion (insertion sort).
Nº Q848955 ★★
Uncommon · Knowledge
Shellsort
In-place comparison sorting algorithm invented by D. Shell
Shellsort, also known as Shell sort or Shell's method, is an in-place comparison sort. It can be understood as either a generalization of sorting by exchange (bubble sort) or sorting by insertion (insertion sort).
From Wikipedia
Shellsort, also known as Shell sort or Shell's method, is an in-place comparison sort. It can be understood as either a generalization of sorting by exchange (bubble sort) or sorting by insertion (insertion sort). The method starts by sorting pairs of elements far apart from each other, then progressively reducing the gap between elements to be compared. By starting with far-apart elements, it can move some out-of-place elements into the position faster than a simple nearest-neighbor exchange. The running time of Shellsort is heavily dependent on the gap sequence it uses. For many practical variants, determining their time complexity remains an open problem. The algorithm was first published by Donald Shell in 1959, and has nothing to do with shells.
Text: Wikipédia, CC BY-SA 4.0. · Image: Simpsons contributor (CC0) ·
Related cards
-
S
Shell (computing)
System software, that provides interfaces and exposes an operating system's services to a human user or other program
Nº Q18109 ★★
Not listed
-
Bucket sort
Sorting algorithm
Nº Q6787153 ★
Not listed
-
Unix shell
Command-line interpreter for Unix operating system
Nº Q14663 ★★
Not listed
-
KornShell
Type of Unix shell
Nº Q204222 ★★
Not listed
-
Tony Hoare
British computer scientist
Nº Q92602 ★★
Not listed
-
Comb sort
Sorting algorithm
Nº Q133939 ★
Not listed