Monthly Archives: July 2017

  1. TODO

    Leave a comment

    July 6, 2017 by oneOokay

    Longest Increasing Subsequence Count of Smaller Numbers After Self Advertisements

  2. Merge sort

    Leave a comment

    July 3, 2017 by oneOokay

    merge sort 是一个divide and conquer. 记不住什么是merge sort大概是因为merge sort的名字里面少了divide… merge sort:包含两部分,divide和merge. 时间复杂度是:O(nlogn) Divide: recursively divide elements into two parts: 所以这里要传入一个left和right index来标明目前要divide是原array中的哪一段 …
    Continue reading