2018年4月13日 星期五

Algorithm :: Big O and little O


Review of definition of big-O/ big-Omega/ big-Theta




A convenient method to judge if it is big-O or little-o

Prove:
https://ch-hsieh.blogspot.com/2010/11/little-oh-big-oh.html

Reference:
[1] UCR CS218: Design and Analysis of Algorithm
http://www.cs.ucr.edu/~stelo/cs218spring18/
[2] Blog of CH-Hsieh
https://ch-hsieh.blogspot.com/2010/11/little-oh-big-oh.html
於
標籤：

沒有留言:

張貼留言

訂閱： 張貼留言 (Atom)
  • Algorithm :: Reservoir Sampling
    Q: For a given size = n array, how to choose k element fairly? A: This is a rather easy question if n is small. What if the size is unkn...
  • C++ :: std vector/ list/ map/ set/ priority queue
    (1) Vector Common method:       vector<int> v;       vector v(10, 0); // {0,0,0,0,0,0,0,0,0,0}       v[i]                  // acc...
  • Algorithm :: Montone queue
    Inspire by Leetcode #239 https://leetcode.com/problems/sliding-window-maximum/description/ The purpose is the maintain a queue (FIFO) an...