Sorting Algorithms

Merge sort by using recursive strategy, i.e. divide and conquer.

def merge(left,right):
    result = []
    i,j =,
    while i < len(left) and j < len(right):
        if left[i]<right[j]:
            result.append(left[i])
            i +=
        else:
            result.append(right[j])
            j +=
    result += left[i:]
    result += right[j:]
    return result
 
def merge_Sort(seq):
    if len(seq)<=:
        return seq
    mid = len(seq)/
    left = merge_Sort(seq[:mid])
    right = merge_Sort(seq[mid:])
    return merge(left,right)
 
seq = [, , , , , , , , , , , , , , , , , , , , ]
merge_Sort(seq)

def ins_sort_rec(seq,i):
    if i==:  return
    ins_sort_rec(seq,i-)
    j = i
    while j >  and seq[j - ] > seq[j]:
        seq[j -],seq[j] = seq[j], seq[j-]
        j -=
    return seq
 
seqq = [,,,,,,,,,,,,,]
 
a = ins_sort_rec(seqq,len(seqq)-)
a 
 
def insertsort(seq):
    for i in range(,len(seq)):
        j = i
        while seq[j] <seq[j-] and j>:
            seq[j],seq[j-] = seq[j-],seq[j]
            j -=
    return seq
 
b = insertsort(seqq)
b
 
def changesort(seq):
    count = True
    while count:
        count = False
        for i in range(,len(seq)):
            if seq[i]<seq[i-]:
                seq[i],seq[i-] = seq[i-],seq[i]
                count =True
    return seq
 
ls = [,,,,,,,,,,,,,]
c = changesort(ls)
c
 
seqq = [,,,,,,,,,,,,,]
 
def selectsort(ls):
    for i in range(len(ls)-):
        k = i
        for j in range(i,len(ls)):
            if ls[k] >ls[j]:
                k = j
        if k !=i:
            ls[i],ls[k]=ls[k],ls[i]
    return ls
selectsort(seqq)