Editing Shellsort (section)

== Applications ==
Shellsort performs more operations and has higher [[CPU cache#Cache miss|cache miss ratio]] than [[quicksort]]. However, since it can be implemented using little code and does not use the [[call stack]], some implementations of the [[qsort]] function in the [[C standard library]] targeted at [[embedded systems]] use it instead of quicksort. Shellsort is, for example, used in the [[uClibc]] library.<ref>{{Cite web
  | url=http://git.uclibc.org/uClibc/tree/libc/stdlib/stdlib.c#n700
  | title=libc/stdlib/stdlib.c
  | first=Manuel III |last=Novoa
  | access-date=2014-10-29}}</ref> For similar reasons, in the past, Shellsort was used in the [[Linux kernel]].<ref>{{Cite web
  | url=https://github.com/torvalds/linux/blob/72932611b4b05bbd89fafa369d564ac8e449809b/kernel/groups.c#L105
  | title=kernel/groups.c
  | website=[[GitHub]]
 | access-date=2012-05-05}}</ref>

Shellsort can also serve as a sub-algorithm of [[introsort|introspective sort]], to sort short subarrays and to prevent a slowdown when the recursion depth exceeds a given limit. This principle is employed, for instance, in the [[bzip2]] compressor.<ref>{{Cite web
  |url=https://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/lxr/source/src/util/compress/bzip2/blocksort.c#L519
  |title=bzip2/blocksort.c
  |author=Julian Seward
  |access-date=2011-03-30}}</ref>