Shell Sort (Frank & Lazarus) (Comparison Sorting Sorting)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n^{1.5})$

Space Complexity

$O({1})$ words

(in-situ sorting)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1960

Reference

https://dl.acm.org/citation.cfm?doid=366947.366957

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Shell_Sort_(Frank_%26_Lazarus)_(Comparison_Sorting_Sorting)&oldid=47306"