aboutsummaryrefslogtreecommitdiff
path: root/challenge-197/lubos-kolouch/python/ch-2.py
blob: d53d9a9f4d2c210cc9a9696e11b8e2a2b6d3629c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import unittest


def wiggle_sort(lst):
    for i in range(len(lst) - 1):
        if (i % 2 == 0 and lst[i] > lst[i + 1]) or (i % 2 == 1 and lst[i] < lst[i + 1]):
            lst[i], lst[i + 1] = lst[i + 1], lst[i]
    return lst


class TestWiggleSort(unittest.TestCase):
    def test_cases(self):
        self.assertEqual(wiggle_sort([1, 5, 1, 1, 6, 4]), [1, 5, 1, 6, 1, 4])
        self.assertEqual(wiggle_sort([1, 3, 2, 2, 3, 1]), [1, 3, 2, 3, 1, 2])


if __name__ == '__main__':
    unittest.main()