python语言学习
文章平均质量分 69
vczhfan
这个作者很懒,什么都没留下…
展开
-
简单scheme计算器-python实现
class nil(object): """The empty list""" def __len__(self): return 0 def map(self,fn): return self def __repr__(self): return 'nil' nil=nil() # nil now refers to原创 2014-07-14 20:08:45 · 498 阅读 · 0 评论 -
heapsort
class heap: def __init__(self,A): self.A=A self.size=0 self.length=len(A)-1 def __setitem__(self,i,x): self.A[i]=x def __getitem__(self,i): return s原创 2014-07-16 08:55:39 · 271 阅读 · 0 评论 -
quicksort in clrs
def quick_sort(A,p,r): if p<r: q=partition(A,p,r) quick_sort(A,p,q-1) quick_sort(A,q+1,r) def partition(A,p,r): x=A[r] i=p-1 for j in range(p,r): if A[j原创 2014-07-16 08:26:37 · 259 阅读 · 0 评论 -
用python实现二项树
class Tree: def __init__(self,entry,left=None,right=None): self.entry=entry self.left=left self.right=right def __repr__(self): args=repr(self.entry) if原创 2014-07-14 18:29:46 · 503 阅读 · 0 评论 -
hw7
class Tree: def __init__(self,entry,left=None,right=None): self.entry=entry self.left=left self.right=right def __repr__(self): args=repr(self.entry) if原创 2014-07-14 18:47:32 · 487 阅读 · 0 评论 -
python list的实现
#include #include using namespace std; const int InitCapacity=100; class List{ private: int *arr; int capacity; int size; void quicksort(int *arr,int left,int right){ if(right-left>1){ int i,原创 2014-07-12 16:46:01 · 332 阅读 · 0 评论 -
lecture5:高阶函数
定义环境 每个函数的值与一个环境帧相关联,原创 2014-07-07 20:51:39 · 287 阅读 · 0 评论 -
interface as documentation
接口(尤其是文档注释)提供了原创 2014-07-08 17:06:38 · 300 阅读 · 0 评论 -
二分查找
def bsearch(a_list,item): first=0 last=len(a_list)-1 found=False while first<=last and not found: midpoint=(first+last)//2 if a_list[midpoint]==item: found=原创 2014-07-18 00:27:19 · 275 阅读 · 0 评论 -
python 哈希表实现
class HashTable: def __init__(self): self.size=11 self.slots=[None]*self.size self.data=[None]*self.size def hash_function(self,key,size): return key%size d原创 2014-07-18 00:56:27 · 966 阅读 · 0 评论 -
实现有序列表和无序列表
class Node: def __init__(self,init_data): self.data=init_data self.next=None def get_data(self): return self.data def get_next(self): return self.next d原创 2014-07-17 23:31:47 · 549 阅读 · 0 评论 -
chap11 哈希表链接法
from functools import reduce from operator import add from random import seed,randint class Node: def __init__(self,key,prev=None,next=None): self.key,self.prev,self.next=key,prev,next cla原创 2014-07-17 15:25:59 · 307 阅读 · 0 评论 -
树的各类算法
class Tree: def __init__(self,key,left=None,right=None,par=None): self.key,self.left,self.right,self.par=key,left,right,par def inorder(t): if t!=None: inorder(t.left)原创 2014-07-16 21:48:56 · 289 阅读 · 0 评论 -
chap11 哈希表实现-开放寻址法
from functools import reduce from operator import add class HashTable: size=97 def hash(k,i): return (reduce(add,map(ord,str(k)),0)+i)%HashTable.size def __init__(self): se原创 2014-07-17 15:51:17 · 908 阅读 · 0 评论 -
chap10 list 单链表实现
class Node: def __init__(self,key,next=None): self.key=key self.next=next class LinkList: def __init__(self): self.nil=Node('error',None) self.nil.next=self.nil原创 2014-07-16 15:17:36 · 283 阅读 · 0 评论 -
chap10-queue
class Queue: initial_capacity=10 def __init__(self): self.A=[0]*self.initial_capacity self.capacity=self.initial_capacity self.head=0 self.tail=0 def __repr原创 2014-07-16 11:16:04 · 299 阅读 · 0 评论 -
chap11 stack
class Stack: initial_capacity=10 def __init__(self): self.A=[0]*self.initial_capacity self.top=0 self.capacity=self.initial_capacity def expand(self): self.原创 2014-07-16 10:38:58 · 270 阅读 · 0 评论 -
clrs chp6
优先队列的实现原创 2014-07-16 09:25:53 · 329 阅读 · 0 评论