Algorithm Study Note(1) Summarize

Divide and Conquer

if(start == end) return Item(start)

mid = start + (end – start) / 2   *Compared with directly (end + start) / 2, this can calculate bigger integers.

left part : start ~ mid

right part : mid + 1 ~ end   recursion

middle part: Consider if part of the result is from left and part from right.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s