Commit f129e375 authored by Tom Almeida's avatar Tom Almeida

updated README

parent 6abd2965
<div id="table-of-contents">
<h2>Table of Contents</h2>
<div id="text-table-of-contents">
<ul>
<li><a href="#org3553ae3">1. Instructions</a></li>
<li><a href="#org3f37671">2. Sorting</a></li>
<li><a href="#orgf581647">3. Searching</a></li>
<li><a href="#org7aab973">4. Path finding</a></li>
<li><a href="#orgb176b5b">5. Tree/Graph functions</a></li>
<li><a href="#org18dc9fa">6. Others</a></li>
<li><a href="#org968e68d">7. Languages</a>
<ul>
<li><a href="#org1faf99e">7.1. C</a></li>
<li><a href="#org4df1415">7.2. C++</a></li>
<li><a href="#org905964a">7.3. Rust</a></li>
</ul>
</li>
</ul>
</div>
</div>
This project is a collection of various algorithms that can be used for various applications. Examples of the implimentations have been written in C, C++ and Rust
<a id="orgaca3a9e"></a>
<a id="org3553ae3"></a>
# Instructions
When editing the readme, do it as an org file instead of md, and export it to md. You will need to do some modification afterwards (It's relatively simple though)
<a id="org9a7f264"></a>
<a id="org3f37671"></a>
# Sorting
- [Quicksort](Pseudocode/Sorting/Quicksort.md)
<a id="orga159917"></a>
# Searching
<a id="orgf581647"></a>
<a id="org007b8d7"></a>
# Searching
## [Binary search](Pseudocode/Searching/binarysearch.html)
- [Binary search](Pseudocode/Searching/binarysearch.md)
<a id="org7427b8d"></a>
<a id="org7aab973"></a>
# Path finding
<a id="orgd85b1a6"></a>
<a id="orgb176b5b"></a>
# Tree/Graph functions
<a id="orge5d3750"></a>
<a id="org18dc9fa"></a>
# Others
<a id="orge4fcf29"></a>
<a id="org968e68d"></a>
# Languages
<a id="orge245488"></a>
<a id="org1faf99e"></a>
## C
This section contains all of the algorithms written in C
<a id="org534c81c"></a>
### Sorting
<a id="orga0dfc2d"></a>
### Searching
1. [Binary search](C/Searching/BinarySearch.c)
<a id="orgb04e7da"></a>
### Path finding
- Sorting
- Searching
- [Binary search](C/Searching/BinarySearch.c)
- Path finding
- Tree/Graph functions
- Others
<a id="org89a7612"></a>
### Tree/Graph functions
<a id="org60d092e"></a>
### Others
<a id="orgfa14148"></a>
<a id="org4df1415"></a>
## C++
This section contains all of the algorithms written in C++
<a id="orgdb46289"></a>
### Sorting
<a id="orgf85ed45"></a>
### Searching
1. [Binary search](C++/Searching/BinarySearch.cpp)
- Sorting
- Searching
- [Binary search](C++/Searching/BinarySearch.cpp)
- Path finding
- Tree/Graph functions
- Others
<a id="org8b97fbd"></a>
### Path finding
<a id="org7760361"></a>
### Tree/Graph functions
<a id="org6e32235"></a>
### Others
<a id="org2a9ef56"></a>
<a id="org905964a"></a>
## Rust
This section contains all of the algorithms written in Rust
<a id="org62058a4"></a>
### Sorting
<a id="org870b3fe"></a>
### Searching
1. [Binary search](Rust/Searching/BinarySearch.rs)
<a id="orgaee84af"></a>
### Path finding
<a id="orgb9952e8"></a>
### Tree/Graph functions
<a id="org39bc08f"></a>
### Others
- Sorting
- Searching
- [Binary search](Rust/Searching/BinarySearch.rs)
- Path finding
- Tree/Graph functions
- Others
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment