Classic Sorting Algorithms

#!/usr/bin/env python
import random

#Merge Sort
def merge(left, right):
    result = []
    i ,j = 0, 0
    while i < len(left) and j < len(right):
        if left[i] <= right[j]:
            result.append(left[i])
            i += 1
        else:
            result.append(right[j])
            j += 1
    result += left[i:]
    result += right[j:]
    return result

def mergeSort(list):
    if len(list) < 2:
        return list
    middle = len(list) / 2
    left = mergesort(list[:middle])
    right = mergesort(list[middle:])
    return merge(left, right)

#Bubble Sort
def bubbleSort(list):
	length = len(list)
	for i in xrange(0,length-1):
		for j in xrange(0,length-1):
			if list[j+1] < list[j]:
				temp = list[j]
				list[j] = list[j+1]
				list[j+1] = temp
				
	return list

#Insertion Sort
def insertionSort(list):
	for i in xrange(1, len(list)):
		j = i
		while j > 0 and list[j] < list[j-1]:
			list[j-1], list[j] = list[j], list[j-1]
			j -= 1
	return list

#Selection Sort
def selectionSort(list):
	for i in xrange(0, len(list)):
		min_index = i
		for j in xrange(i, len(list)):
			if list[j] < list[min_index]:
				min_index = j
		list[i], list[min_index] = list[min_index], list[i]
	return list
        
#Main	
def main():
	list = random.sample(xrange(100), 50)
	print "Unsorted"
	print list
    
	print "Merge Sorted"
	print mergeSort(list)
	
	print "Bubble Sorted"
	print bubbleSort(list)
	
	print "Insertion Sorted"
	print insertionSort(list)
	
	print "Selection Sorted"
	print selectionSort(list)

main()

Browser Version Not Supported

Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+ Firefox 4+ Safari 5+
IE 10+

Let me try anyway!

Python Fiddle

Python Cloud IDE