Algorithm Collection by Marc Auberer

Collection for various useful algorithms. The algorithms are implemented in at least one common programming language and the time complexity is calculated for each algorithm as far as this is possible.

Introduction to pseudocode

In each subfolder for each algorithm is a README file, providing information to the specific algorithm. Besides the actual implementation, there is the pseudocode of each algorithm included in this README. To understand the basic syntax, used for the pseudocode snippets, please take a look at the pseudocode cheatsheet.

Algorithms

There are a variety of different algorithms in this repository. To keep an overview, they are listed here in the index:

Sorting algorithms

• Selection Sort (Kotlin)
• Insertion Sort (Python)
• Quick Sort (Rust)
• Merge Sort (Go)
• Bucket Sort (C#)
• LSD Radix Sort (Java)
• Heap Sort (no implementation yet)
• Bubble Sort (no implemenation yet)

Hash algorithms

more to come

Search algorithms

• Linear Search (no implemenation yet)
• Binary Search (no implemenation yet)
• Interpolation Search (no implemenation yet)
• Exponential Search (no implemenation yet)

Pattern matching algorithms

• Naive Search (Java)
• Boyer & Moore Search (no implemenation yet)
• Knuth, Morris and Pratt Search (no implemenation yet)

Encryption algorithms

• SP Networks (TypeScript, unfinished implementation)

Network encoding algorithms

• Hemming Code (Python / PHP)

Compression algorithms

• QOI Image Format

© Marc Auberer 2020-2022