sort-merge

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).

This version

0.0.1

Oct 10, 2020

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Uploaded Oct 10, 2020 Source

Uploaded Oct 10, 2020 Python 3

Hashes for sort_merge-0.0.1.tar.gz
Algorithm	Hash digest
SHA256	`a64c790c1d88c4feb1f80f16cffb57bc860c7175ecd2bdc8c5d75530b78a7ff5`
MD5	`45c13b095477520c378ab1747a6f6619`
BLAKE2b-256	`19f5cc4df4b297a0feb019be89784c5ced2b8c7c1fb21d559295ebd6e8c0c3a3`

Hashes for sort_merge-0.0.1-py3-none-any.whl
Algorithm	Hash digest
SHA256	`21d19f18e2c7da008caf229d0b33c7c731a28f88b54191db12e0bea38bcd7b8d`
MD5	`fbb93ea3275ded45d1b97d868982d9f2`
BLAKE2b-256	`37bf3f968ce5e0c5bd18253d45533497180cbe3a10473896fd99a81f543eb00e`