算法
Auraro姐姐
一起来敲代码吧
展开
-
插入排序伪代码和实现
插入算法伪代码for j=2 to A.length key=A[j] i=j-1; while i>0 and A[i]>key A[i+1]=A[i] i=i-1 A[i+1]=keyc实现void main(){ int A[]={3,8,1,4,5,0,2,5}; int j;...原创 2018-04-18 16:00:31 · 6605 阅读 · 0 评论 -
归并排序算法的伪代码和实现
伪代码MERGE(A,p,q,r) n1=q-p+1; n2=r-q; create new arrays L[n1+1] and R[n2+1] for i=0 to n1-1 L[i]=A[p+i] for j=0 to n2-1 R[j]=A[q+1+j] L[n1]=1000//假设1000是无穷大 ...原创 2018-04-18 22:34:19 · 15774 阅读 · 0 评论 -
最大子数组的伪代码和代码实现
伪代码findMaxCrossingSubarray(A,low,mid,high) sum=0 leftSum=-9999//假设是无穷小 for i=mid downto low sum=sum+A[i] if sum>leftSum leftSum=sum maxLeft=i sum原创 2018-05-02 23:44:06 · 2624 阅读 · 0 评论