StarMirror/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges.git synced 2024-03-22 13:11:13 +08:00
Code Issues Projects Releases Wiki Activity

Update test_merge_sort.py

Browse Source
This commit is contained in:
monvin 2019-10-02 16:59:08 +05:30 committed by GitHub
parent e4dcc465df
commit fc91acf34b
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 0 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
sorting_searching/merge_sort/test_merge_sort.py
View File

@ -1,6 +1,5 @@
#Like QuickSort, Merge Sort is a Divide and Conquer algorithm. #Like QuickSort, Merge Sort is a Divide and Conquer algorithm.
#It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. #It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves.
#The merge() function is used for merging two halves.
from nose.tools import assert_equal, assert_raises from nose.tools import assert_equal, assert_raises