The hottest sorting algorithm around!
Project description
:volcano: Volcano Sort
The hottest sorting algorithm around!
Disclaimer
This algorithm runs in O(n2). Please don't use this.
Motivation
Our professor mentioned volcanoes when discussing sorting algorithms. I realized there wasn't a "Volcano Sort". There shouldn't be, but now there is.
Methodology
This algorithm first constructs a volcano from the input. Then, the volcano "erupts" and places the numbers in sorted order.
What does this mean?
Given the following input: [4,8,2,2,1,3,0], Volcano Sort will construct a volcano: [1,2,4,8,3,2,0]. It looks like this:
The volcano will erupt and place numbers in increasing order.
Output: [0,1,2,2,3,4,8]
Future Development
None!
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
VolcanoSort-1.0.0.tar.gz
(3.0 kB
view hashes)
Built Distribution
Close
Hashes for VolcanoSort-1.0.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 85faa0b27d2eee4b08a12afaa67dc0cfcf0e3ffa56568c02dff5d35357b8f9a3 |
|
MD5 | 0a376873e7ed4a7e7ce45b9d39b37ee4 |
|
BLAKE2b-256 | 668c79e4ead0a180ca3741639067fe25f18f165e93ecd705edf18320d6a16050 |