Commit 8ddb4af

committed

Merge Sort path modified

1 parent 5aa31e4 commit 8ddb4afCopy full SHA for 8ddb4af

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -60,7 +60,7 @@ In mathematics and computer science, an algorithm is a finite sequence of well-d`
`60`	`60`	`### Sorting - 정렬`
`61`	`61`	`- [Quick sort](https://github.com/lemidia/Algorithm-and-Data-Structure/blob/master/AlgorithmCode/Sorting/QuickSort.java) - 빠른정렬, Worst case: O(n^2), Average case: O(nlogn) where n is the number of item in an array`
`62`	`62`
`63`		`-- [Merge sort](https://github.com/lemidia/Algorithm-and-Data-Structure/blob/master/AlgorithmCode/MergeSort.java) - 병합정렬 O(nlogn)`
	`63`	`+- [Merge sort](https://github.com/lemidia/Algorithm-and-Data-Structure/blob/master/AlgorithmCode/Sorting/MergeSort.java) - 병합정렬 O(nlogn)`
`64`	`64`
`65`	`65`	`- [Counting sort](https://github.com/lemidia/Algorithm-and-Data-Structure/blob/master/AlgorithmCode/Sorting/CountingSort.java) - 카운팅 소트, 계수정렬, O(kn) where k is upper bound`
`66`	`66`

Comments

(0)