Monday, February 15, 2021

data structures index

Data Structures

Algorithms

  Search

    Linear Search (Not-Sort) Time complexity: O(n) ~ O(1)

    Binary search (Sort) Time complexity: O(log n)

      Interpolation Search (Improve Binary search) Time complexity: O(n) ~ O(1)

      Exponential Search (搜尋無限、無邊界的已排序序列。由於邊界未知長度就未知,無法以傳統二元搜尋來找中點。) Time complexity: O(n) ~ O(log  n)

  Ternary Search (Sort)

  Sort

    Stooge Sort (First 2/3 and tail 2/3)

    Insertion Sort Time complexity: O(n) ~ O(n^2)

   Selection sort

    Shellsort

  

Data Structures

  Singly Linked List

  Circular  Doubly Linked List


https://rust-algo.club/searching/interpolation_search/index.html

https://hackmd.io/@cccccs100203 需研究

No comments:

Post a Comment

n8n index

 【n8n免費本地端部署】Windows版|程式安裝x指令大補帖  【一鍵安裝 n8n】圖文教學,獲得無限額度自動化工具&限時免費升級企業版功能