树獭君 - 博客园

2015年10月7日

摘要： (referrence: cmu_binary_heap)DefinitionA binary heap is a complete binary tree arranged in heap ordering property.There are two types of ordering:1. m... 阅读全文

posted @ 2015-10-07 04:56 树獭君阅读(436) 评论(0) 推荐(0)

Types of Binary Tree

摘要： Complete Binary TreeAccording to wiki,A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, an... 阅读全文

posted @ 2015-10-07 04:22 树獭君阅读(267) 评论(0) 推荐(0)

Merge Sort

摘要： (referrence: GeeksforGeeks)MergeSort is aDivide and Conqueralgorithm. It divides input array in two halves, calls itself for the two halves and then m... 阅读全文

posted @ 2015-10-07 03:26 树獭君阅读(297) 评论(0) 推荐(0)

Master Theorem

摘要： Master theorem provides a solution in asymptotic terms to solve time complexity problem of most divide and conquer algorithms.Recurrence relations of ... 阅读全文

posted @ 2015-10-07 03:05 树獭君阅读(593) 评论(0) 推荐(0)

2015年10月6日

Insertion Sort

摘要： (referrence: GeeksforGeeks)Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands.Algorithm// Sort an arr[... 阅读全文

posted @ 2015-10-06 09:04 树獭君阅读(210) 评论(0) 推荐(0)

Amazon Redshift and Massively Parellel Processing

摘要： Today, Yelp held a tech talk in Columbia University about the data warehouse adopted by Yelp.Yelp used Amazon Redshift as data warehouse.There are sev... 阅读全文

posted @ 2015-10-06 08:24 树獭君阅读(275) 评论(0) 推荐(0)

Bubble Sort

摘要： referrence: GeeksforGeeksBubble sortis the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong ord... 阅读全文

posted @ 2015-10-06 05:27 树獭君阅读(134) 评论(0) 推荐(0)

Seletion Sort

摘要： referrence: GeeksforGeeksThe selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order)from unsor... 阅读全文

posted @ 2015-10-06 05:13 树獭君阅读(327) 评论(0) 推荐(0)

App 推荐：Spotify

摘要：之前一直用网易云音乐听歌，后来因为沸沸扬扬的 XCode 注入病毒事件，就把它卸了（无奈脸＝。＝）对比国内其它音乐App，私心觉得网易云音乐还是不错的。没有很多花里胡哨的装饰，里面的歌单做的也还算精致。每首歌还有评论功能，码累了就去翻翻评论（是有多无聊哈哈）正是闹歌荒的时候，小伙伴推荐了这个App ... 阅读全文

posted @ 2015-10-06 04:53 树獭君阅读(530) 评论(0) 推荐(1)

Binary Search

摘要： Time complexity O(log(n)). When the question requires O(log(n)) time complexity, we always need to think whether it can be solved by binary search.For... 阅读全文

posted @ 2015-10-06 04:34 树獭君阅读(186) 评论(0) 推荐(0)

树獭君要好好学算法

好好coding, 天天向上

公告