Simple LP1 Codes

This is a repo that provides simple implementations of LP1 codes.

(Some other codes are very trivial to implement and are almost repetitve, hence left out)

Name		Name	Last commit message	Last commit date
Latest commit History 32 Commits
AIR11.java		AIR11.java
AIR3.java		AIR3.java
AIR6.java		AIR6.java
AIR9.java		AIR9.java
DA1.ipynb		DA1.ipynb
DA2(without_Sklearn_Naive_bayes).ipynb		DA2(without_Sklearn_Naive_bayes).ipynb
DA2.ipynb		DA2.ipynb
HPC1.ipynb		HPC1.ipynb
HPC2.ipynb		HPC2.ipynb
HPC3(MergeSort).ipynb		HPC3(MergeSort).ipynb
HPC3.ipynb		HPC3.ipynb
HPC4(BinarySearch).ipynb		HPC4(BinarySearch).ipynb
LP I schedule 2019.pdf		LP I schedule 2019.pdf
OpenMP_Breadth_First_Search.ipynb		OpenMP_Breadth_First_Search.ipynb
OpenMP_Demo.ipynb		OpenMP_Demo.ipynb
README.md		README.md

Provide feedback