blob: 998f1d600bd8467f5f8172ff4ea30db71fec1c4b (
plain) (
blame)
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
|
# Copyright (c) 2016 Egor Tensin <Egor.Tensin@gmail.com>
# This file is part of the "Sorting algorithms" project.
# For details, see https://github.com/egor-tensin/sorting-algorithms.
# Distributed under the MIT License.
from array import array
from enum import Enum
from random import seed, sample
seed()
class InputKind(Enum):
BEST, AVERAGE, WORST = 'best', 'average', 'worst'
def __str__(self):
return self.value
def _gen_input_from(xs):
return array('l', xs)
def gen_input_for_sorting(n, case=InputKind.AVERAGE):
if n < 0:
raise ValueError('input length cannot be less than zero')
if case is InputKind.BEST:
return _gen_input_from(range(n))
elif case is InputKind.AVERAGE:
return _gen_input_from(sample(range(n), n))
elif case is InputKind.WORST:
return _gen_input_from(range(n - 1, -1, -1))
else:
raise NotImplementedError('invalid input kind: ' + str(case))
|
