From 09a5f648f92c4d83add125c637db868d234144b5 Mon Sep 17 00:00:00 2001
From: pointed732 <jng0820@naver.com>
Date: Fri, 15 Nov 2019 17:27:33 +0900
Subject: [PATCH] Modify Binary search's time complexity
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

O(nlogn) -> O(logN)

이분탐색의 time complexity가 잘못적혀있어서 수정합니다.
---
 Algorithm/Binary Search.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Algorithm/Binary Search.md b/Algorithm/Binary Search.md
index 2095397e..2daf0b6a 100644
--- a/Algorithm/Binary Search.md	
+++ b/Algorithm/Binary Search.md	
@@ -7,7 +7,7 @@
 ```
 * 시간복잡도
 전체 탐색 : O(N)
-이분 탐색 : O(nlogn)
+이분 탐색 : O(logN)
 ```
 
 <br>