algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-07 17:56:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #658 from SunggyuLee/master

Browse Source 
Update README.md
This commit is contained in:
Libin Yang
2018-12-16 16:28:24 +08:00
committed by GitHub
parent a30be78a2d 15e1ae9429
commit 8a3df4a160
1 changed files with 0 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
README.md
View File

@ -119,14 +119,6 @@ __Properties__
* Average case performance O(log n) * Average case performance O(log n)
* Worst case space complexity O(1) * Worst case space complexity O(1)
### Shell
From [Wikipedia][shell-wiki]: Shellsort is a generalization of insertion sort that allows the exchange of items that are far apart. The idea is to arrange the list of elements so that, starting anywhere, considering every nth element gives a sorted list. Such a list is said to be h-sorted. Equivalently, it can be thought of as h interleaved lists, each individually sorted.
__Properties__
* Worst case performance O(nlog2 2n)
* Best case performance O(n log n)
* Average case performance depends on gap sequence
##### View the algorithm in [action][shell-toptal] ##### View the algorithm in [action][shell-toptal]
[bubble-toptal]: https://www.toptal.com/developers/sorting-algorithms/bubble-sort [bubble-toptal]: https://www.toptal.com/developers/sorting-algorithms/bubble-sort