自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(4)
  • 收藏
  • 关注

原创 Starting with Algorithms(Part3)--The maximum-subarray problem

The maximum-subarray problem Giving an array A[1..n] which contains some negative numbers, then find out a nonempty, contiguous subarray of A  whose values have the largest sum. (Note: just need find

2011-11-17 14:49:07 4145

原创 Starting with Algorithms(Part2)

We continue with the same problem in previous section. In this section, however, we examine an alternative design approach, know as "divide-and-conquer" The divide-and-conquer approach Many usef

2011-11-15 13:51:16 567

原创 Abstraction in programs

Abstraction is an central idea in computer science and an understanding of this important term is crucial to successful programming. Abstraction is the purposeful suppression, or hiding, of some

2011-11-13 23:53:07 486

原创 Starting with Algorithms(Part 1)

A sorting problem: Input:  A sequence of n numbers (a1, a2,...,an) Output: A permutation (reordering) (b1,b2,...,bn) of the input sequence such that b1 The pseudo code for insertion sort, which

2011-11-10 16:14:12 417

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除