u011056389的专栏

二叉搜索树的构造#include //BSTreetypedef struct BSTree{ int m_nValue; struct BSTree *m_left; struct BSTree *m_right;}Tree;Tree *CreateBSTree(int *array_list,int nLength);void CreateBSTree(

Python实现插入排序# -*-coding: utf-8 -*-import randomimport stringdef insert_sort(array): ''' The implementation of insertation sort ''' for i in range(1, len(array)): key = array[

快排实现# -*-coding: utf-8 -*-import stringimport randomdef adjustArray(array, l, r): """quick sort one step""" if not array or l < 0 or r < 0 or l > r: return i, j = l, r base =