Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/ksw2000/data-structure-in-c

:notebook: Data Structure in C 資料結構學習筆記
https://github.com/ksw2000/data-structure-in-c

c data-structures pure-c

Last synced: 29 days ago
JSON representation

:notebook: Data Structure in C 資料結構學習筆記

Awesome Lists containing this project

README

        

# Data Structure in C

![](./meme/data-structure-in-c-sakura-tomoyo.png)

### Catalog

+ [Pointer](./Pointer)
+ [01-取址及取值符號.c](./Pointer/01-取址及取值符號.c)
+ [02-利用指標更改記憶體內容.c](./Pointer/02-利用指標更改記憶體內容.c)
+ [03-指標指向一大塊記憶體.c](./Pointer/03-指標指向一大塊記憶體.c)
+ [04-陣列變數之名稱即陣列的位置.c](./Pointer/04-陣列變數之名稱即陣列的位置.c)
+ [String](./String)
+ [README.md](./String/README.md) `介紹字串控制相關函數`
+ [sprintf.c](./String/sprintf.c) `將printf結果存進字串`
+ [strlen.c](./String/strlen.c) `取得字串長度`
+ [strcmp.c](./String/strcmp.c) `字串值是否相同`
+ [strcat.c](./String/strcat.c) `連接兩字串`
+ [strcpy.c](./String/strcpy.c) `複製字串`
+ [Struct](./Struct)
+ [01-基礎格式.c](./Struct/01-基礎格式.c)
+ [02-在結構體後直接宣告變數.c](./Struct/02-在結構體後直接宣告變數.c)
+ [03-結構體搭配typedef.c](./Struct/03-結構體搭配typedef.c)
+ [04-結構體指標.c](./Struct/04-結構體指標.c)
+ [05-函數引用結構體.c](./Struct/05-函數引用結構體.c)
+ [06-函數引用結構體陣列.c](./Struct/06-函數引用結構體陣列.c)
+ [Union](./Union)
+ [union.c](./Union/union.c)
+ [Enum](./Enum)
+ [enum.c](./Enum/enum.c)
+ [Array](./Array)
+ [01-動態宣告二維陣列.c](./Array/01-動態宣告二維陣列.c)
+ Sparse Matrix
+ [Stack](./Stack)
+ [01-陣列實作堆疊-基礎.c](./Stack/01-陣列實作堆疊-基礎.c)
+ [02-陣列實作堆疊-結構體.c](./Stack/02-陣列實作堆疊-結構體.c)
+ [03-鏈結串列實作堆疊.c](./Stack/03-鏈結串列實作堆疊.c)
+ [04-堆疊解迷宮問題.c](./Stack/04-堆疊解迷宮問題.c)
+ [05-用堆疊來計算後序式.c](./Stack/05-用堆疊來計算後序式.c)
+ [Queue](./Queue)
+ [01-陣列實作佇列-基礎.c](./Queue/01-陣列實作佇列-基礎.c)
+ [02-陣列實作佇列-結構體.c](./Queue/02-陣列實作佇列-結構體.c)
+ [03-陣列實作環狀佇列.c](./Queue/03-陣列實作環狀佇列.c)
+ [04-鍵結串列實作佇列.c](./Queue/04-鍵結串列實作佇列.c)
+ [05-動態陣列實作佇列.c](./Queue/05-動態陣列實作佇列.c)
+ [Linked-List](./Linked-List)
+ [01-基礎格式.c](./Linked-List/01-基礎格式.c)
+ [02-自訂lib說明.c](./Linked-List/02-自訂lib說明.c)
+ [03-insert.c](./Linked-List/03-insert.c)
+ [04-delete.c](./Linked-List/04-delete.c)
+ [05-invert.c](./Linked-List/05-invert.c)
+ [06-concatenate.c](./Linked-List/06-concatenate.c)
+ [07-insertFront-circular.c](./Linked-List/07-insertFront-circular.c)
+ [08-length-circular.c](./Linked-List/08-length-circular.c)
+ [09-equivalence.c](./Linked-List/09-equivalence.c)
+ [Tree](./Tree)
+ [AVL-Tree.c](./Tree/AVL-Tree.c)
+ [Binary-Tree.c](./Tree/Binary-Tree.c)
+ [Red-Black-Tree.c](./Tree/Red-Black-Tree.c)
+ Heap
+ [01-simple-max-heap.c](./Heap/01-simple-max-heap.c)
+ Graph
+ Sorting
+ [bubble-sort.c](./Sorting/bubble-sort.c)
+ [insertion-sort.c](./Sorting/insertion-sort.c)
+ [selection-sort.c](./Sorting/selection-sort.c)
+ [merge-sort.c](./Sorting/merge-sort.c)
+ [quick-sort.c](./Sorting/quick-sort.c)
+ [README.md](./Sorting/README.md)
+ [C語言概念澄清.md](./C語言概念澄清.md)