Introduction
Sometimes Julia likes to read a blog written in Chinese, this binary search article is well-written by a facebook engineer, graduated from Syracuse university. Julia tried to learn more about tail recursion, and a few other things discussed in the article.Learning is fun, specially in Chinese. Julia will try to choose a few topics in the article and continue to do some research.
Study of binary search
binary search in "Rotated Sorted Array"
Limitation of array operation, O(1) to look up but O(n) for deletion and insertion
Statistics
Time to read a blog written in Chinese- binary search - 30 minutes ( ended at 1:03pm)
Read the article back and forth 3 times
Read the article back and forth 3 times
20 minutes to read self-balanced binary search tree (start: end: )
Actionable Item
Read one more blog about management and leadership.
No comments:
Post a Comment