摘要：quick sort version 1: quick sort 定义： https://en.wikipedia.org/wiki/Quicksort quick sort 核心部分为partition（http://www.cnblogs.com/jiangchen/p/5398166.html 阅读全文

摘要：Middle of Linked List propose: get the middle element of a linked list method: 1. use two pointers conplexity: o(n) example: Given 1->2->3, return the 阅读全文