Skip to content

test: issue #1 add coverage measurement tool #4

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

test: issue #1 add coverage measurement tool #4

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
31 changes: 27 additions & 4 deletions sorts/cycle_sort.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,6 +3,7 @@
Source: https://en.wikipedia.org/wiki/Cycle_sort
"""

branch_reached = set()

def cycle_sort(array: list) -> list:
"""
Expand All @@ -18,36 +19,58 @@ def cycle_sort(array: list) -> list:
>>> cycle_sort([])
[]
"""
global branch_reached

array_len = len(array)
for cycle_start in range(0, array_len - 1):
branch_reached.add(0)
item = array[cycle_start]

pos = cycle_start
for i in range(cycle_start + 1, array_len):
branch_reached.add(2)
if array[i] < item:
branch_reached.add(3)
pos += 1

branch_reached.add(16)

branch_reached.add(4)

if pos == cycle_start:
branch_reached.add(5)
continue


branch_reached.add(6)

while item == array[pos]:
branch_reached.add(7)
pos += 1
branch_reached.add(8)

array[pos], item = item, array[pos]
while pos != cycle_start:
branch_reached.add(9)
pos = cycle_start
for i in range(cycle_start + 1, array_len):
branch_reached.add(10)
if array[i] < item:
branch_reached.add(11)
pos += 1
branch_reached.add(12)
branch_reached.add(13)

while item == array[pos]:
branch_reached.add(14)
pos += 1

branch_reached.add(15)
array[pos], item = item, array[pos]

branch_reached.add(17)
branch_reached.add(1)
return array


if __name__ == "__main__":
assert cycle_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
assert cycle_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]
print(sorted(branch_reached))
print(len(branch_reached)/18)