Please enable JavaScript.

Coggle requires JavaScript to display documents.

Data Structure (Tree (Threaded binary tree (Insertion, Threads),…

- - - - Inorder
      - Postorder
      - Preorder
- - - - Abstract problem
        
        Algorithm
        
        Data Structure
        
        Programs
        
        Solve
  - - - divided-and-conquer
      - Termination condition of recursion
  - - - Asymptotic Notation
        
        Big-O
        
        表示f(n)之「上界」趨勢能夠以g(n)描述
        
        e.g
        
        f(n)=6n+4, g(n)=7n
        
        Big-Omega
        
        表示f(n)之「下界」趨勢能夠以g(n)描述
        
        e.g
        
        f(n)=6n+4, g(n)=n
        
        Big-Theta
        
        同時找到f(n)的「上界(upper bound)」與「下界(lower bound)」，像是三明治一樣把f(n)夾住。
        
        e.g
        
        f(n)=6n+4, g(n)=n (取最高次)
    - - Amount of memory
      - S(P) = c + Sp(I)
        
        c: fixed space (instruction, simple variables, constants)
        
        Sp(I): depends on characteristics of instance I
    - - Amount of computing time
      - T(P) = c + Tp(I)
        
        c: compile time
        
        Tp(I): program execution time ( Depends on characteristics of instance I )
- - - - first
      - other than the first node
    - - previous
      - current
      - preceding
- - - - RowSize
        
        原先Column各個數的個數
      - RowStart
        
        RowSize 的前綴合
  - - - Prefix table
        
        算最長公共前後綴
      - PosP = pat.f[PosP-1] + 1
- - - - top
      - capacity
      - stack[]
    - - DoubleCapacity
      - push
      - pop
      - top
      - isEmpty
      - getSize
  - - - Variables
        
        back
        
        capacity
        
        queue[]
        
        front
      - Functions
        
        push
        
        pop
        
        isEmpty
        
        getFront
        
        getBack
        
        getSize
        
        DoubleCapacity