pigeonhole
Here are 12 public repositories matching this topic...
A proof of the Pigeonhole principle. The Pigeonhole principle is a fundamental theorem that is used widely in Computer Science and Combinatorics, it asserts that if you put n things into m containers, and n > m, then at least one of the containers contains more than one thing.
-
Updated
Feb 13, 2019 - Makefile
Source based Dovecot with Pigeonhole on Debian Jessie
-
Updated
Mar 5, 2017 - Shell
🐦 with interactive graphic visualization
-
Updated
Oct 2, 2023 - Java
C++ implementation of the Pigeonhole Sorting algorithm using plain arrays
-
Updated
Mar 23, 2022 - C++
Dovecot: IMAP, POP3 & SASL Auth Server (Alpine Linux) ✉️ 🐳 🐙
-
Updated
May 25, 2024 - Makefile
Upper-division Combinatorics Class
-
Updated
Oct 22, 2019 - TeX
Get Started with DNA Sequencing working with .FastQ and .FastA file formats and performing Pattern Matching Algorithms (Exact & Approximate).
-
Updated
Jul 29, 2020 - Jupyter Notebook
These are some of the famous sorting algorithms which I have implemented in C++(more will be added)
-
Updated
Jul 30, 2018 - C++
Mail server based on Postfix, Dovecot and Postfix Admin - Home Assistant Add-on by Erik73
-
Updated
May 23, 2024 - Shell
Improve this page
Add a description, image, and links to the pigeonhole topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the pigeonhole topic, visit your repo's landing page and select "manage topics."