Shellsort

A sorting method proposed by Shell (1959) in which records being sorted can take long jumps instead of being restricted to short steps.

Explore with Wolfram|Alpha

More things to try:

(3+(1-sqrt(2))/(1+sqrt(2)))^(1/3)
d/dx f(x)+g(x)+h(x)
Latin squares

References

Knuth, D. E. The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed. Reading, MA: Addison-Wesley, pp. 83-95, 1998.Shell, D. L. "A High-Speed Sorting Procedure.' 'Comm. ACM 2, No. 7, 30-32, Jul. 1959.

Referenced on Wolfram|Alpha

Shellsort

Cite this as:

Weisstein, Eric W. "Shellsort." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Shellsort.html

Shellsort

See also

Explore with Wolfram|Alpha

References

Referenced on Wolfram|Alpha

Cite this as:

Subject classifications