Sorting a list of numbers with mergesort
Project description
# Sorting numbers using Mergesort Algorithm
This is an implemenatation of mergesort algorithm which sort a list of numbers in ascending order. Time complexity of the algorithm is O(nlogn).
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
sort_merge-0.0.1.tar.gz
(1.9 kB
view hashes)
Built Distribution
Close
Hashes for sort_merge-0.0.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 21d19f18e2c7da008caf229d0b33c7c731a28f88b54191db12e0bea38bcd7b8d |
|
MD5 | fbb93ea3275ded45d1b97d868982d9f2 |
|
BLAKE2b-256 | 37bf3f968ce5e0c5bd18253d45533497180cbe3a10473896fd99a81f543eb00e |