https://github.com/qqiangwu/pure-code
Algorithms needing periodically reviewing
https://github.com/qqiangwu/pure-code
algorithms algorithms-implemented
Last synced: 3 months ago
JSON representation
Algorithms needing periodically reviewing
- Host: GitHub
- URL: https://github.com/qqiangwu/pure-code
- Owner: qqiangwu
- Created: 2017-04-17T03:51:23.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2017-04-19T15:02:22.000Z (about 8 years ago)
- Last Synced: 2025-02-12T11:14:09.677Z (4 months ago)
- Topics: algorithms, algorithms-implemented
- Language: C++
- Homepage:
- Size: 19.5 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# What's this?
This is a project aimed to be a text-book implementation of common data structures and algorithms. It provides both demo implementation and unit tests.
# Principles
The code is intended to be **clean** and **simple**, and efficiency is not the principal goal. I will write the most efficient implementation in terms of computation complexity or provide implementation of different versions.
Code example:
```cpp
template
void linearInsert(Iter first, Iter last)
{
auto insertionPoint = std::upper_bound(first, last, *last);
std::rotate(insertionPoint, last, last + 1);
}
template
void insertionSort(Iter first, Iter last)
{
// [begin, p) sorted
// [p, end) to be processed
for (auto p = first; p != last; ++p) {
linearInsert(first, p);
}
}
```
# Usage
If you want to practice your coding skills, simply download the project and rewrite relevant algorithms and run unit tests yourself.
When you are implementing an algorithm which requires other algorithms or data structures, you can simply use existing implementation in the standard library or in the repo and concentrate on the main ideas, for example:
```c++
template
void quickSort(Iter first, Iter last)
{
if (last - first <= 1) {
return;
}
auto partitionPoint = partition(first, last);
quickSort(first, partitionPoint);
quickSort(partitionPoint, last);
}
```
In the above example, `partition` (implemented in the repo) is guaranteed to return two non-empty ranges if the length of the input range if larger than one such that we are assured that both the following recursion calls will occur on smaller dimensions.
# Todo
You're welcomed to contribute to this project by either:
+ Providing more typical unit tests or corner cases
+ Reporting implementation bugs