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

Update README-ko.md

Browse Source 
~merge
This commit is contained in:
SunggyuLee 2018-12-16 06:24:03 +09:00 committed by GitHub
parent 3167e87049
commit a607bb9561
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
README-ko.md
View File

@ -36,15 +36,15 @@ __속성__
###### View the algorithm in [action][insertion-toptal]
### Merge
### Merge(합병 정렬)
![alt text][merge-image]
From [Wikipedia][merge-wiki]: In computer science, merge sort (also commonly spelt mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945.
From [Wikipedia][merge-wiki]: 컴퓨터 과학에서, 합병 정렬은 효율적인, 범용적인, 비교 기반 정렬 알고리즘이다. 대부분의 구현은 안정적인 분류를 이루는데, 이것은 구현이 정렬된 출력에 동일한 요소의 입력 순서를 유지한다는 것을 의미한다. 합병 정렬은 1945년에 John von Neumann이 발명한 분할 정복 알고리즘이다.
__Properties__
* Worst case performance O(n log n) (typical)
* Best case performance O(n log n)
* Average case performance O(n log n)
* 최악의 성능 O(n log n) (일반적)
* 최고의 성능 O(n log n)
* 평균 O(n log n)
###### View the algorithm in [action][merge-toptal]