thao6626的专栏

# coding:utf-8__author__ = 'taohao'"""bubble sort"""def bubble_sort(array): i = j = 0 length = len(array) while i < length-1: while j < length-i-1: if array[j] >

注意： 此文中的二叉堆默认为最小二叉堆此处的堆排序是降序排序

def quick_sort(array, left, right): if left < right: # the if is necessary. only when left < right, the recursion can be handled i = left j = right tem = array[left]

# coding:utf-8__author__ = 'taohao'""" merge sort use the extra space to exchange the time when merge two arrays, we need to use another empty array to store the completed array so the p

# coding:utf-8__author__ = 'taohao'"""insert sort"""def insert_sort(array): i = 1 while i < len(array): tem = array[i] j = i while tem 0: array[j] =

# coding:utf-8__author__ = 'taohao'"""shell sort is improving the performance of the insert sort"""def shell_sort(array): gap = len(array)/2 while gap > 0: i = gap while

统计10000篇文章中不同单词出现的次数并以次序排序此次统计从两方面入手：一是单线程读取10000个文件；二是打开10000个线程，每个线程读取一个文件单线程程序import java.io.BufferedReader;import java.io.File;import java.io.FileReader;import java.util.ArrayList;im

Hadoop 实现矩阵相乘包括两点：1、mapreduce实现矩阵相乘2、python脚本生成矩阵hadoop com.sun.tools.javac.Main MatrixMutiply.java jar cf matrix.jar MatrixMutiply*.classhadoop fs -rm -r /matrixoutput # 只是在再次运行时需要删掉上一次运行时生成的文件hadoop jar matrix.jar MatrixMutiply /matrixinput/*