Main purpose:

A simple and convenient module for quick sorting of lists using one of the presented sorting methods.

Main functions:

• bubblesort

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted. The algorithm, which is a comparison sort, is named for the way smaller or larger elements "bubble" to the top of the list.

• insertionsort

Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. Insertion sort iterates, consuming one input element each repetition, and grows a sorted output list. At each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.

• shellsort

Sorting algorithm, which is an improved insertion sorting algorithm. The idea of the Schell method is to compare elements that are not only next to each other, but also at a specified distance from each other.

How to use it?

Install all files then simply open CMD and write consistently:

python setup.py build

python setup.py install

python

import sortP

sortP.bubblesort([100,34,56])
sortP.insertionsort([100,34,56])
sortP.shellsort([100,34,56])

Authors:

Yuliya Volkova | [email protected]

Artem Smirnov | [email protected]