Just a few sorting algorithms, which you may find useful (or not).
Project description
Sorting with Linus
This package contains a few sorting methods which you might find useful. Check below for proper usage but here is a short list of all of them:
- bubble sort
- insertion sort
- quick sort
- selection sort
Have fun with these methods.
bubble sort
alist = [54, 26, 93, 17, 77, 31, 44, 55, 20]
print(bubbleSort(alist))
An inefficient but easy to implement sorting algorithm.
selection sort
alist = [54, 26, 93, 17, 77, 31, 44, 55, 20]
print(selectionSort(alist))
An inefficient but easy to implement sorting algorithm.
insertion sort
alist = [54, 26, 93, 17, 77, 31, 44, 55, 20]
print(insertionSort(alist))
An inefficient but easy to implement sorting algorithm.
quick sort
alist = [54,26,93,17,77,31,44,55,20]
quick_sort(alist)
print(alist)
An efficient but hard to implement sorting algorithm. Use this one!
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
sorting_with_linus-0.1.tar.gz
(2.2 kB
view hashes)
Built Distribution
Close
Hashes for sorting_with_linus-0.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 84dc3db2d7296f81e6483b18ba5f3d8dcb0d63a4648231f663751e17bf99f25f |
|
MD5 | 55c00e774d520f20a7b3bf5bc1ffd42b |
|
BLAKE2b-256 | 5abdecd6aa140e51fe558f0860a2b8766dff51e6704bcc937d7361f334c03f35 |