From 68e704d3922435048e7ce585a1ad5237c663241d Mon Sep 17 00:00:00 2001
From: SunggyuLee <37533101+SunggyuLee@users.noreply.github.com>
Date: Sun, 16 Dec 2018 07:47:36 +0900
Subject: [PATCH] Update README.md

delete duplicate description about shell sort
---
 README.md | 8 --------
 1 file changed, 8 deletions(-)

diff --git a/README.md b/README.md
index ee9b9e9e8..9ac45b9ba 100644
--- a/README.md
+++ b/README.md
@@ -119,14 +119,6 @@ __Properties__
 * Average case performance    O(log n)
 * Worst case space complexity    O(1) 
 
-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
-
-
 [bubble-toptal]: https://www.toptal.com/developers/sorting-algorithms/bubble-sort
 [bubble-wiki]: https://en.wikipedia.org/wiki/Bubble_sort
 [bubble-image]: https://upload.wikimedia.org/wikipedia/commons/thumb/8/83/Bubblesort-edited-color.svg/220px-Bubblesort-edited-color.svg.png "Bubble Sort"