MindMap Gallery Data structure - linear table
This is a mind map about data structure - linear tables, including linear tables, stacks and queues, which are all linear tables with limited operations.
Edited at 2023-11-27 15:48:15Explore the intricate lineage of the Crown Royal Family Tree, showcasing the House of Windsor and its notable members. From Queen Elizabeth II and Prince Philip's legacy to their childrenKing Charles III, Princess Anne, Prince Andrew, and Prince Edwarddiscover the marriages and offspring that shape the modern monarchy. Notable branches include the heir apparent, Prince William, and his brother, Prince Harry, alongside their families. Delve into Prince Philip's roots in the House of Glücksburg, connecting British royalty to Denmark and Greece. Join us in tracing this remarkable royal heritage!
This is a panoramic infographic—currently sweeping across the web—illustrating the comprehensive applications of OpenClaw, a popular open-source AI agent platform. It systematically introduces this intelligent agent framework—affectionately dubbed "Lobster Farming"—helping readers quickly grasp its core value, technical features, application scenarios, and security protocols. It serves as an excellent introductory guide and practical manual.
這是一張最近風靡全網關於熱門開源AI代理平台OpenClaw的全網應用全景圖解。它系統性地介紹了這款被稱為「養龍蝦」的智慧體框架,幫助讀者快速理解其核心價值、技術特性、應用場景及安全規範,是一份極佳的入門指南與實操手冊。此圖主要針對希望利用AI建構自動化工作流程的技術從業人員、中小企業主及效率追求者,透過9大模組層層遞進,全面剖析了OpenClaw從概念到落地的整個過程。 圖中核心內容首先釐清了「養龍蝦」指涉的是OpenClawd開源智能體,並強調其本質是「AI基建」而非一般聊天機器人。隨後詳細比較其與傳統AI助理的區別,擁有記憶管理、權限控制、會話隔離和異常恢復四大基礎能力,支援跨平台存取和多模型相容(如GPT、Claude、Ollama)。同時,圖解提供了完整的部署方案(雲端/本地/Docker),並列舉了辦公室自動化、內容創作、資料收集等五大應用程式場景。此外,還展示了其火爆程度、政府與大廠佈局、安全部署建議及適合/不適合的人群分類。幫助你快速掌握OpenClaw技術架構與應用價值,指導個人或企業建構AI自動化系統,規避資料外洩與權限失控風險,是學習「執行式AI」轉型的權威參考圖譜。
Explore the intricate lineage of the Crown Royal Family Tree, showcasing the House of Windsor and its notable members. From Queen Elizabeth II and Prince Philip's legacy to their childrenKing Charles III, Princess Anne, Prince Andrew, and Prince Edwarddiscover the marriages and offspring that shape the modern monarchy. Notable branches include the heir apparent, Prince William, and his brother, Prince Harry, alongside their families. Delve into Prince Philip's roots in the House of Glücksburg, connecting British royalty to Denmark and Greece. Join us in tracing this remarkable royal heritage!
This is a panoramic infographic—currently sweeping across the web—illustrating the comprehensive applications of OpenClaw, a popular open-source AI agent platform. It systematically introduces this intelligent agent framework—affectionately dubbed "Lobster Farming"—helping readers quickly grasp its core value, technical features, application scenarios, and security protocols. It serves as an excellent introductory guide and practical manual.
這是一張最近風靡全網關於熱門開源AI代理平台OpenClaw的全網應用全景圖解。它系統性地介紹了這款被稱為「養龍蝦」的智慧體框架,幫助讀者快速理解其核心價值、技術特性、應用場景及安全規範,是一份極佳的入門指南與實操手冊。此圖主要針對希望利用AI建構自動化工作流程的技術從業人員、中小企業主及效率追求者,透過9大模組層層遞進,全面剖析了OpenClaw從概念到落地的整個過程。 圖中核心內容首先釐清了「養龍蝦」指涉的是OpenClawd開源智能體,並強調其本質是「AI基建」而非一般聊天機器人。隨後詳細比較其與傳統AI助理的區別,擁有記憶管理、權限控制、會話隔離和異常恢復四大基礎能力,支援跨平台存取和多模型相容(如GPT、Claude、Ollama)。同時,圖解提供了完整的部署方案(雲端/本地/Docker),並列舉了辦公室自動化、內容創作、資料收集等五大應用程式場景。此外,還展示了其火爆程度、政府與大廠佈局、安全部署建議及適合/不適合的人群分類。幫助你快速掌握OpenClaw技術架構與應用價值,指導個人或企業建構AI自動化系統,規避資料外洩與權限失控風險,是學習「執行式AI」轉型的權威參考圖譜。
linear structure
linear table
Definition: It is a logical structure, a finite sequence of n data elements of the same data type
sequential storage
Sequence table (logical sequence and physical sequence are the same)
Features
Random access, easy to find
High storage density
Adding or deleting is troublesome
Expansion is troublesome (malloc will increase time complexity)
Method to realize
static allocation
Define a fixed-length array and the system automatically reclaims space
dynamic allocation
Use malloc and free functions (appear in pairs)
Basic operations
insert
Best O(1), worst O(n), average O(n)
delete
Best O(1), worst O(n), average O(n)
Find
Bitwise search
Best/Worst/Average O(1)
Find by value
Best O(1), worst O(n), average O(n)
The main time cost comes from moving elements
chain storage
Linked list (logical order and physical order do not need to be the same)
Features
Low storage density
Easy to insert and delete
Flexible storage
Single list
Create (insert)
Header plug-in method established
O(n)
Tail insertion method established
O(n)
Find
Find by value
O(n)
Bitwise search
O(n)
delete
O(n)
Ask for table length
Just add a counter
O(n)
Double linked list
insert
O(1)
delete
O(1)
Instead of traversing the singly linked list, you can directly find the predecessor pointer and modify it.
Find
O(n)
circular linked list
Circular singly linked list
Point the head node L to the tail, so the time complexity of the tail operation is O(n)
Circular doubly linked list
static linked list
Linked list implemented with array, cursor represents array subscript
The main time overhead comes from moving elements, so in dealing with actual problems, the efficiency of linked list insertion/deletion is higher than that of sequential list
Both stacks and queues are linear tables with limited operations.
stack
queue