コード例 #1
0
 def test_merge_sort_works_correct(self):
     lst = [5, 4, 3, 2, 1]
     merge_sort(lst)
     self.assertEqual(lst, [1, 2, 3, 4, 5])
     lst = [1, 3, 2, 5, 4]
     merge_sort(lst)
     self.assertEqual(lst, [1, 2, 3, 4, 5])
コード例 #2
0
 def doTestMergeSort(self, argument, expected):
     actual = merge_sort(argument)
     message = MergeSortTest.merge_sort_message % (argument, expected, actual)
     self.assertEqual(expected, actual, message)
コード例 #3
0
def test_merge_sort():
    actual = merge_sort([8, 4, 23, 42, 16, 15])
    expected = [4, 8, 15, 16, 23, 42]
    assert actual == expected
def test_merge_sort_1():
    arr = [8, 4, 23, 42, 16, 15]
    result = merge_sort(arr)
    assert result == [4, 8, 15, 16, 23, 42]
コード例 #5
0
def test_merge_sorting(test_lists, expected):
    actual = merge_sort(test_lists)
    assert actual == expected
コード例 #6
0
def test_merge_sort():
    assert merge_sort([8, 4, 23, 42, 16, 15]) == [4, 8, 15, 16, 23, 42]
    assert merge_sort([]) == []
コード例 #7
0
def test_merge_sort_nearly_sorted():
    arr = [2, 3, 5, 7, 13, 11]
    actual = merge_sort(arr)
    expected = [2, 3, 5, 7, 11, 13]
    assert actual == expected
コード例 #8
0
def test_merge_sort_few():
    arr = [5, 12, 7, 5, 5, 7]
    actual = merge_sort(arr)
    expected = [5, 5, 5, 7, 7, 12]
    assert actual == expected
コード例 #9
0
def test_merge_sort_reverse_in():
    arr = [20, 18, 12, 8, 5, -2]
    actual = merge_sort(arr)
    expected = [-2, 5, 8, 12, 18, 20]
    assert actual == expected
コード例 #10
0
def test_that_it_really_does_sort():
    arr = [9, 8, 7, 6, 5, 4, 3, 2, 1]
    merge_sort(arr)
    assert arr == [1, 2, 3, 4, 5, 6, 7, 8, 9]
コード例 #11
0
def test_this_is_not_supossed_to_happen():
    arr = [9, 8, 7, 6, 5, 4, 3, 2, 1]
    merge_sort(arr)
    assert arr != [1, 2, 3, 4, 6, 7, 8, 9, 5]
コード例 #12
0
from merge_sort.merge_sort import merge_sort
from timeit import default_timer as timer
import numpy.random as nprnd

test_values = list(nprnd.randint(-1000, 1000, 10000))

values = [1, 3, 2, 5, 4]
sorted_values = merge_sort(values)

print('Example on Insertions Sort')
print('Initial values: ', values)
print('Sorted Values: ', sorted_values)
print('===========', '\n')

print('Testing Merge Sort algorithm')
print('Test on array of length {}'.format(len(test_values)))
start = timer()
merge_sort(test_values)
end = timer()
print('Total time : {} seconds'.format(end - start), '\n\n')