美文网首页
2019-02-12 GA Algo

2019-02-12 GA Algo

作者: ANPULI | 来源:发表于2019-02-14 00:08 被阅读0次

Divide and conquer

T(n)=aT(\frac{n}{a})+f(n)

Merge sort

T(n)=2T(\frac{n}{2})+n
T(n)=\theta(nlogn)

Binary search

T(n)=T(\frac{n}{2})+1
T(n)=\theta(logn)

Stock price

  1. VP1 on A[1..n/2]
  2. VP2 on A[n/2+1..n]
  3. find smallest in A[1..n/2], bigest in A[n/2+1..n]
    T(n) = 2T(\frac{n}{2})+n=\theta(nlogn)

Exponential

Given a, n, output a**n
Naive: T(n)=T(n-1)+1=n
Smart: T(n)=T(n/2)+1=logn

Fibonacci

Naive: O(n)
Geeky: equation
Theorem:
\begin{bmatrix}F_{n+1}&F_n\\F_n&F_{n-1}\end{bmatrix}=\begin{bmatrix}1&1\\1&0\end{bmatrix}^n
\theta(logn)

Lightbulb technique

Karatsuba multiplication

Toy: addition of n-bit numbers, A=a_1,..a_n, B=b_1..b_n
C=AB, O(n^2)
A = A_0A_1
A=A_0\cdot 2^\frac{n}{2}+A_1
B = B_0B_1
B=B_0\cdot 2^\frac{n}{2}+B_1
C=AB=(A_0\cdot 2^\frac{n}{2}+A_1)(B_0\cdot 2^\frac{n}{2}+B_1)=(A_0B_0)2^n+(A_0B_1+A_1B_0)2^\frac{n}{2}+A_1B_1
T(n)=4T(\frac{n}{2})+O(n)
(A_0+A_1)(B_0+B_1)=A_0B_0+(A_0B_1+A_1B_0)+A_1B_1
T(n)=3T(\frac{n}{2})+O(n)

Strassen multiplication

nxn matrix

相关文章

  • 2019-02-12 GA Algo

    Divide and conquer Merge sort Binary search Stock price V...

  • Strategy Pattern

    IntentDefine a family of algorithms(algo1, algo2, ...);En...

  • 2019-06-15

    kv is data step is algo what about view? view(kv,algo) vi...

  • algo

    夕阳也许坠毁 天空对大地呼喊 我不能够 我不能够 灰黑的暗礁 潮水涌动地扑朔迷离 多年以前的她 转身 黑夜里 看见...

  • Algo

    图灵奖级别资金盘的正确姿势- 好多人到现在还没有搞清楚Algorand设计的资金盘有趣之处。 资金盘在中文里貌似有...

  • 聊algo

    algo(计算) -> 会关注计算的步骤数 -> 不同的结构会影响步数 线性表(数组,链表) 树(树,二叉树) ...

  • 2019-02-12

    2019-02-12 桓台姜博士眼镜商迎新 2019-02-12姜博士眼镜商迎新。大家好!我是来自山东桓台姜博士眼...

  • 2018-02-23

    Once you have completed the technical validation and algo...

  • 深度学习笔记 - 104 - 用Numpy构建神经网络

    Code Results Breaking it Down A Neural Network is an algo...

  • The Difference Between Prime and

    Kruskal Algorithm Prime Algorithm Analysis for Prime Algo...

网友评论

      本文标题:2019-02-12 GA Algo

      本文链接:https://www.haomeiwen.com/subject/thcreqtx.html