- 博客(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关注的人
RSS订阅