Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Updated README with the Shell sort

Browse Source
This commit is contained in:
Mansour 2017-10-04 19:01:50 +02:00
parent e44016cd97
commit ba301ef73e
1 changed files with 10 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
README.md
View File

@ -61,7 +61,17 @@ __Properties__
###### View the algorithm in [action][selection-toptal] ###### View the algorithm in [action][selection-toptal]
### Shell
![alt text][shell-image]
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]
[bubble-toptal]: https://www.toptal.com/developers/sorting-algorithms/bubble-sort [bubble-toptal]: https://www.toptal.com/developers/sorting-algorithms/bubble-sort
[bubble-wiki]: https://en.wikipedia.org/wiki/Bubble_sort [bubble-wiki]: https://en.wikipedia.org/wiki/Bubble_sort