2019.11.05 
#L7
| Name | Major/Grade | GithubID |
|---|---|---|
| 나종명 | 컴퓨터공학과/14 | D-Sinus |
| 조현진 | 컴퓨터공학과/16 | guswh11 |
| 박찬혁 | 소프트웨어학과/19 | WithM2 |
| 손병호 | 소프트웨어학과/19 | sonho00 |
| 장진우 | 소프트웨어학과/19 | doldam0 |
Our project based on algorithms.
Minimal and clean example implementations of data structures and algorithms in Python 3.
For running all tests write down:
$ python3 -m unittest discover tests
For running some specific tests you can do this as following (Ex: sort):
$ python3 -m unittest tests.test_sort
For running all tests write down:
$ python3 -m pytest tests
If you want to use the API algorithms in your code, it is as simple as:
$ pip3 install algorithms
You can test by creating a python file: (Ex: use merge_sort in sort)
from algorithms.sort import merge_sort
if __name__ == "__main__":
my_list = [1, 8, 3, 5, 6]
my_list = merge_sort(my_list)
print(my_list)If you want to uninstall algorithms, it is as simple as:
$ pip3 uninstall -y algorithms
- Add Algorithms
- Not on this project
- To resolve issues
- Improve Algorithms
- Increase algorithm speed
- Use less memory space
- How the algorithms work
- Association with the issue
- Compared to traditional algorithms
- Our static page summing-up our activities.
- This is our static page link
Our wiki page is here.