-
Notifications
You must be signed in to change notification settings - Fork 0
/
test_sort.py
49 lines (31 loc) · 881 Bytes
/
test_sort.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
import random
import pytest
from sort import quicksort, mergesort, straight_mergesort, bubblesort
@pytest.fixture
def seq():
return random.sample(range(10 ** 2), 10)
def test_quicksort(seq):
assert_unsorted(seq)
assert_sorted(quicksort(seq))
def test_mergesort(seq):
assert_unsorted(seq)
assert_sorted(mergesort(seq))
def test_straight_mergesort(seq):
assert_unsorted(seq)
assert_sorted(straight_mergesort(seq))
def test_bubblesort(seq):
assert_unsorted(seq)
assert_sorted(bubblesort(seq))
def sortable(func):
def _wrapper(seq):
if len(seq) < 2:
return
return func(seq)
return _wrapper
@sortable
def assert_sorted(seq):
for i in range(len(seq) - 1):
assert seq[i] <= seq[i + 1]
@sortable
def assert_unsorted(seq):
assert any(seq[i] > seq[i + 1] for i in range(len(seq) - 1))