We strive to #disrupt sorting in new and exciting ways. By demonstrating revolutionary, modern, and versatile sorting algorithms, we hope to #growthhack your projects and synergize with your big data.
We're always striving for greatness, so although not all code has been updated for the new contribution format, it is recommended that these simple guidelines are followed for contributing your new, state-of-the-art sorting algorithm.
The project root contains the name of the sort in lowercase.
├── bogobogo
├── bogosort
├── sleepsort
└── tacosort
Inside of the sort's directory contains two things:
- A README.md containing the pseudocode for the sort.
- Folders labeled by language.
├── sleepsort
│ ├── java
│ ├── python
| ├── swift
│ └── README.md
└── tacosort
├── java
├── javascript
├── python
├── swift
└── README.md
Inside of your language's directory contains two things:
- The source file in the language denoted by the folder.
- A readme containing various details about your specific sort. This can include (if applicable):
- Dependencies.
- Command line formatting.
- Example command.
- Credits.
# Dependencies
Python 3
# Running
python3 sleep-sort.py [Space separated numbers]
## Example
python3 sleep-sort.py 5 1 3 2
# Credits
Wade Mauger @wadeanthony0100
Your sort implementation should be designed with the following criteria in mind:
- Your sort operates via the command line.
- Input is consumed on stdin.
- Output is produced on stdout.