SW_LCC的博客

def binary_search (sort_list,item) : length = len(sort_list) low = 0; high = length -1 while low<=high : mid = (high-low) // 2 current_item = sort_list[...

python实现 def quick_sort(collection): length = len(collection) if length<=1 : return collection else: pivot = collection.pop() greater,lesser = [] ,[] f...

python实现: def selection_sort(collection): length = len(collection) for i in range(length-1): least = i; for k in range(i+1,length): if collection[k] < collectio...