Shell Sort (Sedgewick) (Comparison Sorting Sorting)

From Algorithm Wiki
Revision as of 09:33, 10 April 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{1.{3}3})$ == Space Complexity == $O({1})$ words (in-situ sorting) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1986 == Reference == https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0196677486900015?via%3Dihub")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{1.{3}3})$

Space Complexity

$O({1})$ words

(in-situ sorting)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1986

Reference

https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0196677486900015?via%3Dihub

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Shell_Sort_(Sedgewick)_(Comparison_Sorting_Sorting)&oldid=47308"