Skip to content

Resolved the BUG #480

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.

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 2 commits into
base: master
Choose a base branch
from
Open
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
11 changes: 6 additions & 5 deletions readme.md
Original file line number Diff line number Diff line change
Expand Up @@ -63,12 +63,13 @@ Code | Test
[Chinese Remainder Theorem](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/c%2B%2B/chineseRemainderTheorem.cpp) | Missing tests

### C
Code | Test
------------ | -------------

[Linear Search](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/c%2B%2B/Linear_Search.c) | Missing tests
[Binary Search](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/c%2B%2B/Binary_Search.c) | Missing tests
[Depth First Search](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/C/dfs.c) | Missing tests
| Algorithm | Code (GitHub Link) | Test Status |
|--------------------|--------------------------------------------------------------|-------------------------------------------------|
| Linear Search | [Linear Search](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/c%2B%2B/Linear_Search.c) | **Missing Tests** |
| Binary Search | [Binary Search](https://github.com/larissalages/code_various/Binary_Search.c) **(Corrected Path)** | **Missing Tests** |
| Depth First Search | [Depth First Search](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/C/dfs.c) | **Missing Tests** |



# Codeforces
Expand Down