Commit 0ca80fd2 authored by Tom Almeida's avatar Tom Almeida

updated README

parent d2769fcc
......@@ -43,3 +43,7 @@ function quicksort(array)
Quicksort is often compared to Mergesort as they both have an average time complexity of O(nlogn). According to the perldoc:
> On average, mergesort does fewer comparisons than quicksort, so it may be better when complicated comparison routines are used. Mergesort also takes advantage of pre-existing order, so it would be favored for using sort() to merge several sorted arrays. On the other hand, quicksort is often faster for small arrays, and on arrays of a few distinct values, repeated many times.
### Languages
* [Rust](../../Rust/Sorting/Quicksort.rs)
* [C++](../../C++/Sorting/Quicksort.cpp)
* [C](../../C/Sorting/Quicksort.c)
......@@ -2,17 +2,16 @@
<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>
<li><a href="#org3a0e500">1. Sorting</a></li>
<li><a href="#orgb42203a">2. Searching</a></li>
<li><a href="#org51c0df9">3. Path finding</a></li>
<li><a href="#orged50cfc">4. Tree/Graph functions</a></li>
<li><a href="#orga33708b">5. Others</a></li>
<li><a href="#org44449d7">6. 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>
<li><a href="#orgde31006">6.1. C</a></li>
<li><a href="#org4084c44">6.2. C++</a></li>
<li><a href="#orgdf434a4">6.3. Rust</a></li>
</ul>
</li>
</ul>
......@@ -21,54 +20,51 @@
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="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="org3f37671"></a>
<a id="org3a0e500"></a>
# Sorting
- [Quicksort](Pseudocode/Sorting/Quicksort.md)
- [Heapsort](Pseudocode/Sorting/C/Sorting/Heapsort.c))
- [Mergesort](Pseudocode/Sorting/Mergesort.md)
<a id="orgf581647"></a>
<a id="orgb42203a"></a>
# Searching
- [Binary search](Pseudocode/Searching/binarysearch.md)
<a id="org7aab973"></a>
<a id="org51c0df9"></a>
# Path finding
<a id="orgb176b5b"></a>
<a id="orged50cfc"></a>
# Tree/Graph functions
<a id="org18dc9fa"></a>
<a id="orga33708b"></a>
# Others
<a id="org968e68d"></a>
<a id="org44449d7"></a>
# Languages
<a id="org1faf99e"></a>
<a id="orgde31006"></a>
## C
This section contains all of the algorithms written in C
- Sorting
- [Quicksort](C/Sorting/Quicksort.c)
- [Heapsort](C/Sorting/Heapsort.c)
- Searching
- [Binary search](C/Searching/BinarySearch.c)
- Path finding
......@@ -76,13 +72,15 @@ This section contains all of the algorithms written in C
- Others
<a id="org4df1415"></a>
<a id="org4084c44"></a>
## C++
This section contains all of the algorithms written in C++
- Sorting
- [Quicksort](C++/Sorting/Quicksort.cpp)
- [Heapsort](C++/Sorting/Heapsort.cpp)
- Searching
- [Binary search](C++/Searching/BinarySearch.cpp)
- Path finding
......@@ -90,13 +88,15 @@ This section contains all of the algorithms written in C++
- Others
<a id="org905964a"></a>
<a id="orgdf434a4"></a>
## Rust
This section contains all of the algorithms written in Rust
- Sorting
- [Quicksort](Rust/Sorting/Quicksort.rs)
- [Heapsort](Rust/Sorting/Heapsort.rs)
- Searching
- [Binary search](Rust/Searching/BinarySearch.rs)
- Path finding
......
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
* 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)
* Sorting
- [[file:Pseudocode/Sorting/Quicksort.md][Quicksort]]
- [[file:Pseudocode/Sorting/C/Sorting/Heapsort.c)][Heapsort]]
- [[file:Pseudocode/Sorting/Mergesort.md::```][Mergesort]]
* Searching
** [[file:Pseudocode/Searching/binarysearch.html][Binary search]]
- [[file:Pseudocode/Searching/binarysearch.md][Binary search]]
* Path finding
* Tree/Graph functions
* Others
* Languages
** C
This section contains all of the algorithms written in C
*** Sorting
*** Searching
**** [[file:C/Searching/BinarySearch.c::int%20comparisonFunction(const%20void*%20pkey,%20const%20void*%20pelem)%20{};][Binary search]]
*** Path finding
*** Tree/Graph functions
*** Others
- Sorting
- [[file:C/Sorting/Quicksort.c::/%20Quicksort%20algorithm][Quicksort]]
- [[file:C/Sorting/Heapsort.c::}][Heapsort]]
- Searching
- [[file:C/Searching/BinarySearch.c::int%20comparisonFunction(const%20void*%20pkey,%20const%20void*%20pelem)%20{};][Binary search]]
- Path finding
- Tree/Graph functions
- Others
** C++
This section contains all of the algorithms written in C++
*** Sorting
*** Searching
***** [[file:C++/Searching/BinarySearch.cpp::/%20Recursively][Binary search]]
*** Path finding
*** Tree/Graph functions
*** Others
- Sorting
- [[file:C++/Sorting/Quicksort.cpp::#include%20<algorithm>%20/%20for%20std::partition][Quicksort]]
- [[file:C++/Sorting/Heapsort.cpp][Heapsort]]
- Searching
- [[file:C++/Searching/BinarySearch.cpp::/%20Recursively][Binary search]]
- Path finding
- Tree/Graph functions
- Others
** Rust
This section contains all of the algorithms written in Rust
*** Sorting
*** Searching
***** [[file:Rust/Searching/BinarySearch.rs::}][Binary search]]
*** Path finding
*** Tree/Graph functions
*** Others
- Sorting
- [[file:Rust/Sorting/Quicksort.rs][Quicksort]]
- [[file:Rust/Sorting/Heapsort.rs::}][Heapsort]]
- Searching
- [[file:Rust/Searching/BinarySearch.rs::}][Binary search]]
- 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