Billowen

摘要： 最近在看《算法导论》，同时又在学习Python，所以想到用PYTHON实现看过的算法，来练手。PYTHON帮忙看看有没有需要改进的写法。刚接触PYTHON，可能代码写得不够优美。def quick_sort(A, left, right): if right > left: # choose the left item as pivot pivotIndex = left pivotNewIndex = partition(A, left, right, pivotIndex) quick_sort(A, left, pivotNe... 阅读全文

摘要： 最近在看《算法导论》，同时又在学习Python，所以想到用PYTHON实现看过的算法，来练手。PYTHON帮忙看看有没有需要改进的写法# Suppose the index of current item is i,# then the parent index is int( (i-1)/2 ),# the left child index is 2*i+1,# the right child index is 2*i+2heap_size = int()def heapsort(A): global heap_size heap_size = 0 build_max_he... 阅读全文