Skip to main content

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:

  1. bubble sort
  2. insertion sort
  3. quick sort
  4. 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

This version

0.1

Download files

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

Files for sorting-with-linus, version 0.1
Filename, size File type Python version Upload date Hashes
Filename, size sorting_with_linus-0.1-py3-none-any.whl (3.3 kB) File type Wheel Python version py3 Upload date Hashes View
Filename, size sorting_with_linus-0.1.tar.gz (2.2 kB) File type Source Python version None Upload date Hashes View

Supported by

Pingdom Pingdom Monitoring Google Google Object Storage and Download Analytics Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page