fossabot/algorithm-implementations

I always update this repository with algorithm implementations from "Introduction to algorithms (Third Edition)".

Algorithm-implementations

insertion-sort.py

How does it work?

Insertion Sort (I'm going to call it "the algorithm", I don't want to type too much), sort one element at the time. It's not efficient on a large number of data.

Then where you can use it?

• If you have an almost sorted data set, it will be a lot faster than any algorithm.
• It can sort the data set while it receives it.
• It's really simple to implement, you can create a three-line version of it in C.

for (i = 1; i < n; i++)
  for (j = i; j > 0; j--)
    if (a[j] < a[j-1]) swap(a[j], a[j-1])

Example

$: python insertion-sort.py 1 7 3 4 8 2 3 5 9 10 
[1, 7, 3, 4, 8, 2, 3, 5, 9, 10]
[1, 2, 3, 3, 4, 5, 7, 8, 9, 10]

insertion-sort-nonincreasing.py

It's the same as the 'insertion-sort.py', just it puts the array in decreasing order.

Example

$: python insertion-sort-nonincreasing.py 1 3 3 5 4
[1, 3, 3, 5, 4]
[5, 4, 3, 3, 1]

License