Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
23 changes: 23 additions & 0 deletions .github/workflows/pytest.yml
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
name: Run tests with pytest
on:
push:
pull_request:

jobs:
build:
runs-on: ubuntu-latest
steps:
- uses: actions/checkout@v4
- name: Install Python
uses: actions/setup-python@v5
with:
python-version: "3.13"

- name: Install dependencies
run: |
python -m pip install --upgrade pip
pip install pytest
pip install pytest-repeat

- name: Run tests
run: pytest
Empty file added l06_testing/__init__.py
Empty file.
Empty file added l06_testing/src/__init__.py
Empty file.
23 changes: 23 additions & 0 deletions l06_testing/src/heap_sort.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
def heapify(arr: list, n: int, i: int) -> None:
largest = i
left = 2 * i + 1
right = 2 * i + 2

if left < n and arr[i] < arr[left]:
largest = left

if right < n and arr[largest] < arr[right]:
largest = right

if largest != i:
arr[i], arr[largest] = arr[largest], arr[i]
heapify(arr, n, largest)


def heap_sort(arr: list) -> None:
for i in range(len(arr) - 1, -1, -1):
heapify(arr, len(arr), i)

for i in range(len(arr) - 1, 0, -1):
arr[i], arr[0] = arr[0], arr[i]
heapify(arr, i, 0)
Empty file added l06_testing/tests/__init__.py
Empty file.
10 changes: 10 additions & 0 deletions l06_testing/tests/conftest.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
import random

import pytest


@pytest.fixture
def random_list():
list_len = random.randint(100, 5000)
random_list = [random.randint(-(10**11), 10**11) for _ in range(list_len)]
return random_list
20 changes: 20 additions & 0 deletions l06_testing/tests/test_parametrized.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
import pytest

from l06_testing.src.heap_sort import heap_sort


@pytest.mark.parametrize(
["arr", "expected"],
[
([1, 5, 3, 2, 4], [1, 2, 3, 4, 5]),
([7, 6, 23423524], [6, 7, 23423524]),
([[], []]),
([5], [5]),
([2, 2, 2, 2], [2, 2, 2, 2]),
([0, 1, 0, 1, 0, 1, 0, 1], [0, 0, 0, 0, 1, 1, 1, 1]),
([12, -100, 47, -123, -5, 1, 0, -3], [-123, -100, -5, -3, 0, 1, 12, 47]),
],
)
def test_sort_parametrized(arr, expected):
heap_sort(arr)
assert arr == expected
11 changes: 11 additions & 0 deletions l06_testing/tests/test_random.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
import pytest

from l06_testing.src.heap_sort import heap_sort


@pytest.mark.repeat(100)
def test_sort_random(random_list): # noqa: F811
expected = sorted(random_list)
heap_sort(random_list)

assert random_list == expected