示例#1
0
def SelectionSort(LI):
    for loop1 in range(len(LI)):
        min = loop1
        for loop2 in range(loop1, len(LI) - 1):
            if LI[loop2] < LI[min]:
                min = loop2
        if min <> loop1:
            Swap.swap(LI, min, loop1)
示例#2
0
def partition(LI, lo, hi):
    j = lo
    for i in range(lo, hi):
        if LI[i] < LI[hi]:
            Swap.swap(LI, i, j)
            j += 1
    Swap.swap(LI, j, hi)
    print "\n", LI[lo:hi]
    return j
示例#3
0
def InsertionSort(LI):
	
	for loop1 in range(len(LI)):
		i = loop1
		print
		while i > 0 and LI[i] < LI[i-1]:
			Swap.swap(LI,i,i-1)
			i -= 1
			print LI
示例#4
0
def SelectionSort(LI):
	for loop1 in range(len(LI)):
		min = loop1
		for loop2 in range(loop1,len(LI)-1):
			if LI[loop2] < LI[min]:
				min = loop2
		if min <> loop1:
			Swap.swap(LI,min,loop1)
示例#5
0
def partition(LI,lo,hi):
	j = lo
	for i in range(lo,hi):
		if LI[i] < LI[hi]:
			Swap.swap(LI,i,j)
			j += 1
	Swap.swap(LI,j,hi)
	print "\n",LI[lo:hi]
	return j
示例#6
0
def BubbleSort(LI):
	swapped = True

	while swapped:	
		for loop1 in range(len(LI)):
			swapped = False
			for loop2 in range(len(LI)-1-loop1):
				if LI[loop2] > LI[loop2+1]:
					Swap.swap(LI,loop2,loop2+1)
					swapped = True
示例#7
0
def BubbleSort(LI):
    swapped = True

    while swapped:
        for loop1 in range(len(LI)):
            swapped = False
            for loop2 in range(len(LI) - 1 - loop1):
                if LI[loop2] > LI[loop2 + 1]:
                    Swap.swap(LI, loop2, loop2 + 1)
                    swapped = True