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

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

diff --git a/README.md b/README.md
index 959f676e..f0fcdd66 100644
--- a/README.md
+++ b/README.md
@@ -119,14 +119,6 @@ __Properties__
 * Average case performance    O(log n)
 * 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]
 
 [bubble-toptal]: https://www.toptal.com/developers/sorting-algorithms/bubble-sort