mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-23 21:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity
All Algorithms implemented in Python the-algorithms.com/
49 Commits 8 Branches 0 Tags 417 MiB
Python 99.9%
Shell 0.1%
a2d2e4d6b5
Go to file
Naveen Arunachalam a2d2e4d6b5 Fix typo in documentation
2016-08-04 11:16:55 -07:00
ciphers Added test cases 2016-08-02 23:16:55 +05:30
detect english Improvement 2016-08-02 23:44:38 +05:30
searches Move files to separate directories 2016-08-01 15:06:53 +05:00
sorts Fix typo in documentation 2016-08-04 11:16:55 -07:00
.gitignore Sortings and searching algorithms refactoring 2016-08-01 12:49:43 +05:00
.travis.yml Change .travis.yml 2016-08-03 00:42:39 +05:30
README.md Update README.md 2016-08-02 21:08:33 +05:30

README.md

The Algorithms - Python Build Status

All algorithms implemented in Python (for education)

These are for demonstration purposes only. There are many implementations of sorts in the Python standard library that are much better for performance reasons.

Sorting Algorithms

Binary

Add comments here

Bubble

alt text

From Wikipedia: Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.

Properties

  • Worst case performance O(n^2)
  • Best case performance O(n)
  • Average case performance O(n^2)
View the algorithm in action

Insertion

alt text

From Wikipedia: Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.

Properties

  • Worst case performance O(n^2)
  • Best case performance O(n)
  • Average case performance O(n^2)
View the algorithm in action

Merge

alt text

From Wikipedia: In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945.

Properties

  • Worst case performance O(n log n)
  • Best case performance O(n)
  • Average case performance O(n)
View the algorithm in action

Quick

alt text

From Wikipedia: Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order.

Properties

  • Worst case performance O(n^2)
  • Best case performance O(n log n) or O(n) with three-way partition
  • Average case performance O(n^2)
View the algorithm in action

Search Algorithms

Linear

Add comments here

Ciphers

Caesar

Add comments here