Report for Assignment 1

Project chosen

Name: TheAlgorithms Python

URL: (https://github.com/subbarayudu-j/TheAlgorithms-Python)

Programming language: Python

Number of lines + Tool

11810 python lines counted using lizard

How to:

    > pip install lizard

    > lizard -l python # -l chooses the lines of the language lizard should count

Coverage measurement with existing tool

Tool Used: coverage

How to:

    > pip install coverage


    > coverage run -m pytest # in tests folder


    > coverage report  # or "coverage html" for a nice representation

Results:

For 'coverage html'

Coverage measurement with our own "tool"

David Gilson

depth_of_tree:

Link to commit for coverage instrumentation

is_full_binary_tree:

Link to commit for coverage instrumentation )

Melisa Damian

binary_search.py

Link to the commit with coverage measurement Edited the print_coverage later on [Screenshot of the coverage measurement]

bucket_sort.py

Link to the commit with coverage measurement [Screenshot of the coverage measurement]

For bucket sort, the coverage should be the same for all lists except for the empty one, because all the possible inputs trigger all the branches except for the one checking for an empty list. Due to an error whenever I am attempting to input an empty list which could be fixed only by editing the code of the authors of this repo, I am unable to present that one in the screenshot.

Ashwin Iyer

gnome_sort.py

[Link to the commit for gnome_sort.py] [Added more coverage]

jump_search.py

[Link to the commit for jump_search.py]

Patrick Darie

bubble_sort.py

Link to the commit with coverage measurement

merge_sort.py

Link to the commit with coverage measurement

Coverage improvement

David Gilson

test_tree_depth.py:

Link to a commit the new test tree depth tests

Before adding new tests

After adding new tests

The coverage goes straight to 96% as it had no previous tests covering it. So by creating tests covering each branch of the depth_of_tree function, we could already cover 96% of it without needing to enchance anything, just making new tests.

test_full_binary:

Link to a commit the new test tree depth tests

Before adding new tests

After adding new tests

The coverage goes straight to 97% as it had no previous tests covering it. So by creating tests covering each branch of the is_full_binary function, we could already cover 97% of it without needing to enchance anything, just making new tests.

Melisa Damian

test_binary_search.py

Link to the commit

Before adding new tests

After adding new tests

The overall coverage for the project went lower because there are functions inside of the binary_search.py file which are not being covered by any other tests than mine. The coverage for the whole binary_search.py file is 41% due to the fact that there are multiple functions within it, and I have improved the coverage only for one of them. Furthermore, the code doesn't have any tests to cover for those missing it. Below I will provide a screenshot of the coverage html with my binary_search function.

test_bucket_sort.py

Link to the commit

Before adding new tests

After adding new tests

Here, the overall coverage for the project increases due to the fact that within bucket_sort.py, the only function in it is bucket_sort, which is 95% covered by the tests I've added. It's 95% because it lacks the case for an empty list, which doesn't work (mentioned above why).

Ashwin Iyer

jump_search.py

Link to the commit

Before adding new tests

After adding new tests

There were no previous tests for jump_search, and therefore the coverage is at 94% for test_jump_search.py. As we can see, the overall coverage has increased from 92% to 93%. This has been achieved by creating tests for each branch of the jump_sort function.