JS-Sorting-Algorithm/src/pythonSortTest.py at master · hustcc/JS-Sorting-Algorithm · GitHub

History

216 lines (180 loc) · 5.42 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

'''

# Create by LokiSharp(loki.sharp#gmail) at 2017-1-22

'''

TOTAL = 5000

def sortTest(func, total=1000):

import random, copy, operator, math, time

arrList = [i for i in range(-math.floor(total / 2), math.ceil(total / 2))]

arrListR = copy.deepcopy(arrList)

while operator.eq(arrList, arrListR):

random.shuffle(arrListR)

# print("--- [Origin List]", arrList, "Use", func.__name__,"with Total:", len(arrList))

# print("--> [Random List]", arrListR, "Use", func.__name__,"with Total:", len(arrList))

start = time.clock()

arrListR = func(arrListR)

end = time.clock()

runtime = end - start

# print("--> [Sorted List]", arrListR, "Use", func.__name__,"with Total:", len(arrList))

if operator.eq(arrList, arrListR):

print("[Success]", func.__name__, "with Total:", len(arrList), "in %.5fs" % runtime)

return True

else:

print("[Fail]", func.__name__, "with Total:", len(arrList), "in %.5fs" % runtime)

return False

def bubbleSort(arr):

for i in range(1, len(arr)):

for j in range(0, len(arr) - i):

if arr[j] > arr[j + 1]:

arr[j], arr[j + 1] = arr[j + 1], arr[j]

return arr

def selectionSort(arr):

for i in range(len(arr) - 1):

# 记录最小数的索引

minIndex = i

for j in range(i + 1, len(arr)):

if arr[j] < arr[minIndex]:

minIndex = j

# i 不是最小数时，将 i 和最小数进行交换

if i != minIndex:

arr[i], arr[minIndex] = arr[minIndex], arr[i]

return arr

def insertionSort(arr):

for i in range(len(arr)):

preIndex = i - 1

current = arr[i]

while preIndex >= 0 and arr[preIndex] > current:

arr[preIndex + 1] = arr[preIndex]

preIndex -= 1

arr[preIndex + 1] = current

return arr

def shellSort(arr):

import math

gap = 1

while (gap < len(arr) / 3):

gap = gap * 3 + 1

while gap > 0:

for i in range(gap, len(arr)):

temp = arr[i]

j = i - gap

while j >= 0 and arr[j] > temp:

arr[j + gap] = arr[j]

j -= gap

arr[j + gap] = temp

gap = math.floor(gap / 3)

return arr

def mergeSort(arr):

import math

if (len(arr) < 2):

return arr

middle = math.floor(len(arr) / 2)

left, right = arr[0:middle], arr[middle:]

return merge(mergeSort(left), mergeSort(right))

def merge(left, right):

result = []

while left and right:

if left[0] <= right[0]:

result.append(left.pop(0));

else:

result.append(right.pop(0));

while left:

result.append(left.pop(0));

while right:

result.append(right.pop(0));

return result

def quickSort(arr, left=None, right=None):

left = 0 if not isinstance(left, (int, float)) else left

right = len(arr) - 1 if not isinstance(right, (int, float)) else right

if left < right:

partitionIndex = partition(arr, left, right)

quickSort(arr, left, partitionIndex - 1)

quickSort(arr, partitionIndex + 1, right)

return arr

def partition(arr, left, right):

pivot = left

index = pivot + 1

i = index

while i <= right:

if arr[i] < arr[pivot]:

swap(arr, i, index)

index += 1

i += 1

swap(arr, pivot, index - 1)

return index - 1

def swap(arr, i, j):

arr[i], arr[j] = arr[j], arr[i]

def buildMaxHeap(arr):

import math

for i in range(math.floor(len(arr) / 2), -1, -1):

heapify(arr, i)

def heapify(arr, i):

left = 2 * i + 1

right = 2 * i + 2

largest = i

if left < arrLen and arr[left] > arr[largest]:

largest = left

if right < arrLen and arr[right] > arr[largest]:

largest = right

if largest != i:

swap(arr, i, largest)

heapify(arr, largest)

def swap(arr, i, j):

arr[i], arr[j] = arr[j], arr[i]

def heapSort(arr):

global arrLen

arrLen = len(arr)

buildMaxHeap(arr)

for i in range(len(arr) - 1, 0, -1):

swap(arr, 0, i)

arrLen -= 1

heapify(arr, 0)

return arr

def countingSort(arr, maxValue=None):

bucketLen = maxValue + 1

bucket = [0] * bucketLen

sortedIndex = 0

arrLen = len(arr)

for i in range(arrLen):

if not bucket[arr[i]]:

bucket[arr[i]] = 0

bucket[arr[i]] += 1

for j in range(bucketLen):

while bucket[j] > 0:

arr[sortedIndex] = j

sortedIndex += 1

bucket[j] -= 1

return arr

def radix_count(exp1):

global list

n = len(list)

output = [0] * (n)

count = [0] * (10)

for i in range(0, n):

index = (list[i] / exp1)

count[(index) % 10] += 1

for i in range(1,10):

count[i] += count[i - 1]

i = n - 1

while i >= 0:

index = (list[i]/exp1)

output[count[(index) % 10] - 1] = list[i]

count[(index) % 10] -= 1

i -= 1

i = 0

for i in range(0,len(list)):

list[i] = output[i]

def radixSort():

global list

max1 = max(list)

exp = 1

while max1 / exp > 0:

radix_count(exp)

exp *= 10

if __name__ == '__main__':

sortTest(bubbleSort, TOTAL)

sortTest(selectionSort, TOTAL)

sortTest(insertionSort, TOTAL)

sortTest(shellSort, TOTAL)

sortTest(mergeSort, TOTAL)

sortTest(quickSort, TOTAL)

sortTest(heapSort, TOTAL)

sortTest(radixSort, TOTAL)

JS-Sorting-Algorithm/src/pythonSortTest.py at master · hustcc/JS-Sorting-Algorithm · GitHub

Uh oh!

Expand file tree

Breadcrumbs

pythonSortTest.py

Latest commit

History

Breadcrumbs

pythonSortTest.py

File metadata and controls