Search this site
Embedded Files
sjshyu@DataStructures.IMF.NYCU.tw
  • Home
    • Text Books
    • Scoring
    • Contact
    • About S. J. Shyu
    • Students
      • 2024 Spring - 2024 Summer
      • 2023 Spring - 2023 Summer
      • 2022 Spring - 2022 Summer
      • 2021 Autumn - 2022 Spring
      • 2020 Autumn - 2021 Spring
      • 2019 Autumn - 2020 Spring
      • 2018 Autumn - 2019 Spring
      • 2017 Autumn - 2018 Spring
      • 2016 Autumn - 2017 Spring
    • Feedback
    • Recomandation Letters
  • Lecture Notes
    • Current Semester
    • Errata
    • Video
    • Lecture Notes 2024 Spring
    • Lecture Notes 2023 Spring
      • pps
      • PDF (1 slide/A4)
      • PDF (2 slides/A4)
      • PDF (4 slides/A4)
    • Lecture Notes 2022 Spring
      • PPS
      • PDF (1 slide/A4 page)
      • PDF (2 slides/A4 page)
      • PDF (4 slides/A4 page)
    • Lecture Notes 2021 Autumn
      • PPS
      • PDF (1 slide/A4 page)
      • PDF (2 slides/A4 page)
      • PDF (4 slides/A4 page)
      • Class Video
    • Lecture Notes 2020 Autumn - 2021 Spring
    • Lecture Notes 2019 Autumn - 2020 Spring
      • pps
      • pdf (one slide/page)
      • pdf (two slides/page)
      • pdf (four slides/page)
    • Lecture Notes 2018 Autumn - 2019 Spring
      • pps
      • pdf (one slide/page)
      • pdf (two slides/page)
      • pdf (four slides/page)
    • Lecture Notes 2017 Spring
      • pps
      • pdf
      • pdf (2in1)
      • pdf (4in1)
  • Programming Assignment
    • How to run your C programs
    • HW1 Selection, Bubble and Binary Search
    • B1 (Bonus) Power and Polynomial」的複本
    • HW2 Magic Square
    • B2 (Bonus) Knight Tour
    • HW3 Mouse in Maze
    • HW4 infix2prefix/postfix
    • B3 (Bonus) n-Queen
    • HW5 Singly Linked List
    • B4 (Bonus) Addition of polynomials
    • HW6 Binary Search Tree
    • HW7 Shortest Path
    • Option: TOS:Topologicl Sorting Sequence
    • B5(Bonus) MST: Kruskal and Prim Algorithms
    • HW8 Performance Evaluation for Sorting Algorithms
    • 2022 Autumn
      • HW1 Selection, Bubble and Binary Search
      • HW1 Selection, Bubble, Quick Sorts and Binary Search
      • HW2 Magic Square
      • B1 (Bonus) Power and Polynomial
      • B2 (Bonus) Knight Tour
      • HW3 Mouse in Maze
      • HW4 Infix/Postfix/Prefix
      • B3 (Bonus) infix2prefix/postfix
      • HW5 Singly Linked List
      • B4 (Bonus) Addition of polynomials
      • HW6 Binary Search Tree
      • HW7 Shortest Path
      • B5 (Bonus) MST: Kruskal and Prim Algorithms
      • HW8 Performance Evaluation for Sorting Algorithms
    • 2021 Autumn
      • HW1 Selection Sort vs Bubble Sort
      • HW2 Permutations and Hanoi Towers
      • B1 (Bonus) Power and Polynomial
      • HW3 Magic Square
      • B2. (Bonus) Knight Tour
      • HW4 Mouse in Maze
      • HW5 infix2prefix/postfix
      • HW6 Singly Linked List
      • B3 (Bonus) Addition of polynomials
      • HW7 Binary Search Tree
      • HW8 Shortest Path
      • B4 (Bonus) MST: Kruskal and Prim Algorithms
      • HW9 Performance Evaluation for Sorting Algorithms
    • 2020 Autumn
      • HW1 Selection Sort vs Bubble Sort
      • HW2 Permutations and Hanoi Towers
      • HW3 Magic Square
      • B1 (Bonus) Power and Polynomial
      • HW4 Mouse in Maze
      • B2 (Bonus) infix2prefix/postfix
      • HW5 Singly Linked List
      • HW6 Binary Search Tree
      • HW7 Shortest Path
      • B3 (Bonus) Performance Evaluation for Sorting Algorithms
      • B4 (Bonus) Addition of polynomials
      • B5 (Bonus) MST: Kruskal and Prim Algorithms
    • 2019 Autumn
      • HW1 Selection Sort vs Bubble Sort
      • HW2 Permutations and Hanoi Towers
      • HW3 Magic Square
      • B1 (Bonus) Power and Polynomial
      • HW4 Mouse in Maze
      • B2 (Bonus) infix2prefix/postfix
      • HW5 Singly Linked List
      • HW6 Binary Search Tree
      • HW7 Shortest Path
      • B3 (Bonus) MST: Kruskal and Prim Algorithms
      • B4 (Bonus) All strings of {A,C,G,T}
    • 2018 Autumn
      • HW1 Selection Sort vs Bubble Sort
      • HW2 Permutations and Hanoi Towers
      • HW3 Magic Square
      • HW4 Mouse in Maze
      • HW5 (Bonus) infix2prefix/postfix
      • 「HW5 (Bonus) infix2prefix/postfix」的複本
      • HW6 Singly Linked List
      • HW6 Binary Search Tree
      • HW7 Binary Search Tree
      • HW8 MST: Kruskal and Prim Algorithm
      • Bonus All strings of {A,C,G,T}
      • Bonus Shortest Path
    • B1 (Bonus) Power and Polynomial
    • 2024 Autumn
      • 「HW1 Selection, Bubble and Binary Search」的複本
      • 「B1 (Bonus) Power and Polynomial」的複本」的複本
      • 「HW2 Magic Square」的複本
      • 「B2 (Bonus) Knight Tour」的複本
      • 「HW3 Mouse in Maze」的複本
      • 「HW4 infix2prefix/postfix」的複本
      • 「B3 (Bonus) n-Queen」的複本
      • 「HW5 Singly Linked List」的複本
      • 「B4 (Bonus) Addition of polynomials」的複本
      • 「HW6 Binary Search Tree」的複本
      • 「HW7 Shortest Path」的複本
      • 「Option: MST: Kruskal and Prim Algorithms」的複本
      • 「B5 (Bonus) TOS:Topologicl Sorting Sequence」的複本
      • 「HW8 Performance Evaluation for Sorting Algorithms」的複本
  • Javascript clips
  • Exercise
  • Programming Tips
    • 00. 如何計算CPU執行時間
    • 01. 如何製作獨立執行檔
    • 01-1 Debug/Release in C++ Builder
    • 01-2 Size of int/(int *) in 32/64-bit Platform
    • 02. 如何宣告動態陣列
    • 03. 如何在輸出時固定欄寬
    • 04. n 皇后
    • 05-1 richTextBox 內容寫入檔案
    • 05. 讀入檔案並於 Mome, StringGrid 中呈現 (C++ Builder, VS C++)
    • 06-1. 用 StringGrid (C++ Builder) 表示陣列資料
    • 06-2. 用 StringGrid 表示迷宮 (BCB)
    • 06-3. 用 StringGrid 呈現動畫 (OnDrawCell, Refresh)
    • 06-4 BMP/JPG in StringGrid Cells
    • 06. 如何用datagridview表示迷宮
    • 07. VS C++中的enum
    • 08. VS C++中的全域變數
    • 09 infix2postfix 逐步實作 VS C++
    • 10. 挑選排序與二元搜尋
    • 11. 計算階乘
    • 12. Permutations (排列)
    • 13. 數字加總
    • 15. Fast Exponentiation
    • 20-1 Font Color in richTextBox (VS C++)
    • 20. 魔術方塊
    • 21. 線性搜尋
    • 22. 矩陣相加
    • 23. 矩陣相乘
    • 24. 轉置矩陣
    • 25. 河內塔
    • 27. Knight Tour
    • 30. Maze: randomly generated
    • 30.0 Maze: DFS generation
    • 30.1 Keyboard Control
    • 30-1 Mouse in a Maze
    • 30-2 Animation by Changing Colors in dataGridView
    • 31. 中序轉後序
    • 32. String ^ and wchar_t in VS C++
    • 33 C++ Builder Ansistring 使用方法
    • 40. 鏈結串列
    • 42. 雙向鏈結串列
    • 50. 中/後/前序走訪
    • 51. 二元搜尋樹、畫出二元樹
    • 60. 產生表示圖的亂數矩陣 (VC++)
    • 70. 排序程式之cpu時間比較
    • 71. 排序程式之cpu時間畫圖表 (ZedGraph)
    • 72. 排序程式之cpu時間畫圖表 (TChart)
    • 73. Chart in C++ Builder
    • 74. Chart in VS C++
    • 80. VS 20xx 程式小細節
      • 01.視窗程式下 struct 寫法
      • 02.String 的宣告方式
    • 90. infix2postfix 逐步實作 (using VS C++)
    • 91.Parallel Scan
    • 92.Visual Cryptography
  • Previous Exams
  • Q&A
    • QA01 CodeBlocks ~.exe execution
  • Resources
    • C++ Builder
    • Indent Style
    • Constructive Sites
    • About C++ Builder
sjshyu@DataStructures.IMF.NYCU.tw
  • Home
    • Text Books
    • Scoring
    • Contact
    • About S. J. Shyu
    • Students
      • 2024 Spring - 2024 Summer
      • 2023 Spring - 2023 Summer
      • 2022 Spring - 2022 Summer
      • 2021 Autumn - 2022 Spring
      • 2020 Autumn - 2021 Spring
      • 2019 Autumn - 2020 Spring
      • 2018 Autumn - 2019 Spring
      • 2017 Autumn - 2018 Spring
      • 2016 Autumn - 2017 Spring
    • Feedback
    • Recomandation Letters
  • Lecture Notes
    • Current Semester
    • Errata
    • Video
    • Lecture Notes 2024 Spring
    • Lecture Notes 2023 Spring
      • pps
      • PDF (1 slide/A4)
      • PDF (2 slides/A4)
      • PDF (4 slides/A4)
    • Lecture Notes 2022 Spring
      • PPS
      • PDF (1 slide/A4 page)
      • PDF (2 slides/A4 page)
      • PDF (4 slides/A4 page)
    • Lecture Notes 2021 Autumn
      • PPS
      • PDF (1 slide/A4 page)
      • PDF (2 slides/A4 page)
      • PDF (4 slides/A4 page)
      • Class Video
    • Lecture Notes 2020 Autumn - 2021 Spring
    • Lecture Notes 2019 Autumn - 2020 Spring
      • pps
      • pdf (one slide/page)
      • pdf (two slides/page)
      • pdf (four slides/page)
    • Lecture Notes 2018 Autumn - 2019 Spring
      • pps
      • pdf (one slide/page)
      • pdf (two slides/page)
      • pdf (four slides/page)
    • Lecture Notes 2017 Spring
      • pps
      • pdf
      • pdf (2in1)
      • pdf (4in1)
  • Programming Assignment
    • How to run your C programs
    • HW1 Selection, Bubble and Binary Search
    • B1 (Bonus) Power and Polynomial」的複本
    • HW2 Magic Square
    • B2 (Bonus) Knight Tour
    • HW3 Mouse in Maze
    • HW4 infix2prefix/postfix
    • B3 (Bonus) n-Queen
    • HW5 Singly Linked List
    • B4 (Bonus) Addition of polynomials
    • HW6 Binary Search Tree
    • HW7 Shortest Path
    • Option: TOS:Topologicl Sorting Sequence
    • B5(Bonus) MST: Kruskal and Prim Algorithms
    • HW8 Performance Evaluation for Sorting Algorithms
    • 2022 Autumn
      • HW1 Selection, Bubble and Binary Search
      • HW1 Selection, Bubble, Quick Sorts and Binary Search
      • HW2 Magic Square
      • B1 (Bonus) Power and Polynomial
      • B2 (Bonus) Knight Tour
      • HW3 Mouse in Maze
      • HW4 Infix/Postfix/Prefix
      • B3 (Bonus) infix2prefix/postfix
      • HW5 Singly Linked List
      • B4 (Bonus) Addition of polynomials
      • HW6 Binary Search Tree
      • HW7 Shortest Path
      • B5 (Bonus) MST: Kruskal and Prim Algorithms
      • HW8 Performance Evaluation for Sorting Algorithms
    • 2021 Autumn
      • HW1 Selection Sort vs Bubble Sort
      • HW2 Permutations and Hanoi Towers
      • B1 (Bonus) Power and Polynomial
      • HW3 Magic Square
      • B2. (Bonus) Knight Tour
      • HW4 Mouse in Maze
      • HW5 infix2prefix/postfix
      • HW6 Singly Linked List
      • B3 (Bonus) Addition of polynomials
      • HW7 Binary Search Tree
      • HW8 Shortest Path
      • B4 (Bonus) MST: Kruskal and Prim Algorithms
      • HW9 Performance Evaluation for Sorting Algorithms
    • 2020 Autumn
      • HW1 Selection Sort vs Bubble Sort
      • HW2 Permutations and Hanoi Towers
      • HW3 Magic Square
      • B1 (Bonus) Power and Polynomial
      • HW4 Mouse in Maze
      • B2 (Bonus) infix2prefix/postfix
      • HW5 Singly Linked List
      • HW6 Binary Search Tree
      • HW7 Shortest Path
      • B3 (Bonus) Performance Evaluation for Sorting Algorithms
      • B4 (Bonus) Addition of polynomials
      • B5 (Bonus) MST: Kruskal and Prim Algorithms
    • 2019 Autumn
      • HW1 Selection Sort vs Bubble Sort
      • HW2 Permutations and Hanoi Towers
      • HW3 Magic Square
      • B1 (Bonus) Power and Polynomial
      • HW4 Mouse in Maze
      • B2 (Bonus) infix2prefix/postfix
      • HW5 Singly Linked List
      • HW6 Binary Search Tree
      • HW7 Shortest Path
      • B3 (Bonus) MST: Kruskal and Prim Algorithms
      • B4 (Bonus) All strings of {A,C,G,T}
    • 2018 Autumn
      • HW1 Selection Sort vs Bubble Sort
      • HW2 Permutations and Hanoi Towers
      • HW3 Magic Square
      • HW4 Mouse in Maze
      • HW5 (Bonus) infix2prefix/postfix
      • 「HW5 (Bonus) infix2prefix/postfix」的複本
      • HW6 Singly Linked List
      • HW6 Binary Search Tree
      • HW7 Binary Search Tree
      • HW8 MST: Kruskal and Prim Algorithm
      • Bonus All strings of {A,C,G,T}
      • Bonus Shortest Path
    • B1 (Bonus) Power and Polynomial
    • 2024 Autumn
      • 「HW1 Selection, Bubble and Binary Search」的複本
      • 「B1 (Bonus) Power and Polynomial」的複本」的複本
      • 「HW2 Magic Square」的複本
      • 「B2 (Bonus) Knight Tour」的複本
      • 「HW3 Mouse in Maze」的複本
      • 「HW4 infix2prefix/postfix」的複本
      • 「B3 (Bonus) n-Queen」的複本
      • 「HW5 Singly Linked List」的複本
      • 「B4 (Bonus) Addition of polynomials」的複本
      • 「HW6 Binary Search Tree」的複本
      • 「HW7 Shortest Path」的複本
      • 「Option: MST: Kruskal and Prim Algorithms」的複本
      • 「B5 (Bonus) TOS:Topologicl Sorting Sequence」的複本
      • 「HW8 Performance Evaluation for Sorting Algorithms」的複本
  • Javascript clips
  • Exercise
  • Programming Tips
    • 00. 如何計算CPU執行時間
    • 01. 如何製作獨立執行檔
    • 01-1 Debug/Release in C++ Builder
    • 01-2 Size of int/(int *) in 32/64-bit Platform
    • 02. 如何宣告動態陣列
    • 03. 如何在輸出時固定欄寬
    • 04. n 皇后
    • 05-1 richTextBox 內容寫入檔案
    • 05. 讀入檔案並於 Mome, StringGrid 中呈現 (C++ Builder, VS C++)
    • 06-1. 用 StringGrid (C++ Builder) 表示陣列資料
    • 06-2. 用 StringGrid 表示迷宮 (BCB)
    • 06-3. 用 StringGrid 呈現動畫 (OnDrawCell, Refresh)
    • 06-4 BMP/JPG in StringGrid Cells
    • 06. 如何用datagridview表示迷宮
    • 07. VS C++中的enum
    • 08. VS C++中的全域變數
    • 09 infix2postfix 逐步實作 VS C++
    • 10. 挑選排序與二元搜尋
    • 11. 計算階乘
    • 12. Permutations (排列)
    • 13. 數字加總
    • 15. Fast Exponentiation
    • 20-1 Font Color in richTextBox (VS C++)
    • 20. 魔術方塊
    • 21. 線性搜尋
    • 22. 矩陣相加
    • 23. 矩陣相乘
    • 24. 轉置矩陣
    • 25. 河內塔
    • 27. Knight Tour
    • 30. Maze: randomly generated
    • 30.0 Maze: DFS generation
    • 30.1 Keyboard Control
    • 30-1 Mouse in a Maze
    • 30-2 Animation by Changing Colors in dataGridView
    • 31. 中序轉後序
    • 32. String ^ and wchar_t in VS C++
    • 33 C++ Builder Ansistring 使用方法
    • 40. 鏈結串列
    • 42. 雙向鏈結串列
    • 50. 中/後/前序走訪
    • 51. 二元搜尋樹、畫出二元樹
    • 60. 產生表示圖的亂數矩陣 (VC++)
    • 70. 排序程式之cpu時間比較
    • 71. 排序程式之cpu時間畫圖表 (ZedGraph)
    • 72. 排序程式之cpu時間畫圖表 (TChart)
    • 73. Chart in C++ Builder
    • 74. Chart in VS C++
    • 80. VS 20xx 程式小細節
      • 01.視窗程式下 struct 寫法
      • 02.String 的宣告方式
    • 90. infix2postfix 逐步實作 (using VS C++)
    • 91.Parallel Scan
    • 92.Visual Cryptography
  • Previous Exams
  • Q&A
    • QA01 CodeBlocks ~.exe execution
  • Resources
    • C++ Builder
    • Indent Style
    • Constructive Sites
    • About C++ Builder
  • More
    • Home
      • Text Books
      • Scoring
      • Contact
      • About S. J. Shyu
      • Students
        • 2024 Spring - 2024 Summer
        • 2023 Spring - 2023 Summer
        • 2022 Spring - 2022 Summer
        • 2021 Autumn - 2022 Spring
        • 2020 Autumn - 2021 Spring
        • 2019 Autumn - 2020 Spring
        • 2018 Autumn - 2019 Spring
        • 2017 Autumn - 2018 Spring
        • 2016 Autumn - 2017 Spring
      • Feedback
      • Recomandation Letters
    • Lecture Notes
      • Current Semester
      • Errata
      • Video
      • Lecture Notes 2024 Spring
      • Lecture Notes 2023 Spring
        • pps
        • PDF (1 slide/A4)
        • PDF (2 slides/A4)
        • PDF (4 slides/A4)
      • Lecture Notes 2022 Spring
        • PPS
        • PDF (1 slide/A4 page)
        • PDF (2 slides/A4 page)
        • PDF (4 slides/A4 page)
      • Lecture Notes 2021 Autumn
        • PPS
        • PDF (1 slide/A4 page)
        • PDF (2 slides/A4 page)
        • PDF (4 slides/A4 page)
        • Class Video
      • Lecture Notes 2020 Autumn - 2021 Spring
      • Lecture Notes 2019 Autumn - 2020 Spring
        • pps
        • pdf (one slide/page)
        • pdf (two slides/page)
        • pdf (four slides/page)
      • Lecture Notes 2018 Autumn - 2019 Spring
        • pps
        • pdf (one slide/page)
        • pdf (two slides/page)
        • pdf (four slides/page)
      • Lecture Notes 2017 Spring
        • pps
        • pdf
        • pdf (2in1)
        • pdf (4in1)
    • Programming Assignment
      • How to run your C programs
      • HW1 Selection, Bubble and Binary Search
      • B1 (Bonus) Power and Polynomial」的複本
      • HW2 Magic Square
      • B2 (Bonus) Knight Tour
      • HW3 Mouse in Maze
      • HW4 infix2prefix/postfix
      • B3 (Bonus) n-Queen
      • HW5 Singly Linked List
      • B4 (Bonus) Addition of polynomials
      • HW6 Binary Search Tree
      • HW7 Shortest Path
      • Option: TOS:Topologicl Sorting Sequence
      • B5(Bonus) MST: Kruskal and Prim Algorithms
      • HW8 Performance Evaluation for Sorting Algorithms
      • 2022 Autumn
        • HW1 Selection, Bubble and Binary Search
        • HW1 Selection, Bubble, Quick Sorts and Binary Search
        • HW2 Magic Square
        • B1 (Bonus) Power and Polynomial
        • B2 (Bonus) Knight Tour
        • HW3 Mouse in Maze
        • HW4 Infix/Postfix/Prefix
        • B3 (Bonus) infix2prefix/postfix
        • HW5 Singly Linked List
        • B4 (Bonus) Addition of polynomials
        • HW6 Binary Search Tree
        • HW7 Shortest Path
        • B5 (Bonus) MST: Kruskal and Prim Algorithms
        • HW8 Performance Evaluation for Sorting Algorithms
      • 2021 Autumn
        • HW1 Selection Sort vs Bubble Sort
        • HW2 Permutations and Hanoi Towers
        • B1 (Bonus) Power and Polynomial
        • HW3 Magic Square
        • B2. (Bonus) Knight Tour
        • HW4 Mouse in Maze
        • HW5 infix2prefix/postfix
        • HW6 Singly Linked List
        • B3 (Bonus) Addition of polynomials
        • HW7 Binary Search Tree
        • HW8 Shortest Path
        • B4 (Bonus) MST: Kruskal and Prim Algorithms
        • HW9 Performance Evaluation for Sorting Algorithms
      • 2020 Autumn
        • HW1 Selection Sort vs Bubble Sort
        • HW2 Permutations and Hanoi Towers
        • HW3 Magic Square
        • B1 (Bonus) Power and Polynomial
        • HW4 Mouse in Maze
        • B2 (Bonus) infix2prefix/postfix
        • HW5 Singly Linked List
        • HW6 Binary Search Tree
        • HW7 Shortest Path
        • B3 (Bonus) Performance Evaluation for Sorting Algorithms
        • B4 (Bonus) Addition of polynomials
        • B5 (Bonus) MST: Kruskal and Prim Algorithms
      • 2019 Autumn
        • HW1 Selection Sort vs Bubble Sort
        • HW2 Permutations and Hanoi Towers
        • HW3 Magic Square
        • B1 (Bonus) Power and Polynomial
        • HW4 Mouse in Maze
        • B2 (Bonus) infix2prefix/postfix
        • HW5 Singly Linked List
        • HW6 Binary Search Tree
        • HW7 Shortest Path
        • B3 (Bonus) MST: Kruskal and Prim Algorithms
        • B4 (Bonus) All strings of {A,C,G,T}
      • 2018 Autumn
        • HW1 Selection Sort vs Bubble Sort
        • HW2 Permutations and Hanoi Towers
        • HW3 Magic Square
        • HW4 Mouse in Maze
        • HW5 (Bonus) infix2prefix/postfix
        • 「HW5 (Bonus) infix2prefix/postfix」的複本
        • HW6 Singly Linked List
        • HW6 Binary Search Tree
        • HW7 Binary Search Tree
        • HW8 MST: Kruskal and Prim Algorithm
        • Bonus All strings of {A,C,G,T}
        • Bonus Shortest Path
      • B1 (Bonus) Power and Polynomial
      • 2024 Autumn
        • 「HW1 Selection, Bubble and Binary Search」的複本
        • 「B1 (Bonus) Power and Polynomial」的複本」的複本
        • 「HW2 Magic Square」的複本
        • 「B2 (Bonus) Knight Tour」的複本
        • 「HW3 Mouse in Maze」的複本
        • 「HW4 infix2prefix/postfix」的複本
        • 「B3 (Bonus) n-Queen」的複本
        • 「HW5 Singly Linked List」的複本
        • 「B4 (Bonus) Addition of polynomials」的複本
        • 「HW6 Binary Search Tree」的複本
        • 「HW7 Shortest Path」的複本
        • 「Option: MST: Kruskal and Prim Algorithms」的複本
        • 「B5 (Bonus) TOS:Topologicl Sorting Sequence」的複本
        • 「HW8 Performance Evaluation for Sorting Algorithms」的複本
    • Javascript clips
    • Exercise
    • Programming Tips
      • 00. 如何計算CPU執行時間
      • 01. 如何製作獨立執行檔
      • 01-1 Debug/Release in C++ Builder
      • 01-2 Size of int/(int *) in 32/64-bit Platform
      • 02. 如何宣告動態陣列
      • 03. 如何在輸出時固定欄寬
      • 04. n 皇后
      • 05-1 richTextBox 內容寫入檔案
      • 05. 讀入檔案並於 Mome, StringGrid 中呈現 (C++ Builder, VS C++)
      • 06-1. 用 StringGrid (C++ Builder) 表示陣列資料
      • 06-2. 用 StringGrid 表示迷宮 (BCB)
      • 06-3. 用 StringGrid 呈現動畫 (OnDrawCell, Refresh)
      • 06-4 BMP/JPG in StringGrid Cells
      • 06. 如何用datagridview表示迷宮
      • 07. VS C++中的enum
      • 08. VS C++中的全域變數
      • 09 infix2postfix 逐步實作 VS C++
      • 10. 挑選排序與二元搜尋
      • 11. 計算階乘
      • 12. Permutations (排列)
      • 13. 數字加總
      • 15. Fast Exponentiation
      • 20-1 Font Color in richTextBox (VS C++)
      • 20. 魔術方塊
      • 21. 線性搜尋
      • 22. 矩陣相加
      • 23. 矩陣相乘
      • 24. 轉置矩陣
      • 25. 河內塔
      • 27. Knight Tour
      • 30. Maze: randomly generated
      • 30.0 Maze: DFS generation
      • 30.1 Keyboard Control
      • 30-1 Mouse in a Maze
      • 30-2 Animation by Changing Colors in dataGridView
      • 31. 中序轉後序
      • 32. String ^ and wchar_t in VS C++
      • 33 C++ Builder Ansistring 使用方法
      • 40. 鏈結串列
      • 42. 雙向鏈結串列
      • 50. 中/後/前序走訪
      • 51. 二元搜尋樹、畫出二元樹
      • 60. 產生表示圖的亂數矩陣 (VC++)
      • 70. 排序程式之cpu時間比較
      • 71. 排序程式之cpu時間畫圖表 (ZedGraph)
      • 72. 排序程式之cpu時間畫圖表 (TChart)
      • 73. Chart in C++ Builder
      • 74. Chart in VS C++
      • 80. VS 20xx 程式小細節
        • 01.視窗程式下 struct 寫法
        • 02.String 的宣告方式
      • 90. infix2postfix 逐步實作 (using VS C++)
      • 91.Parallel Scan
      • 92.Visual Cryptography
    • Previous Exams
    • Q&A
      • QA01 CodeBlocks ~.exe execution
    • Resources
      • C++ Builder
      • Indent Style
      • Constructive Sites
      • About C++ Builder

pdf (4 slides/page)

CH01_Basic Concept_2022_0213_4inOne.pdf
CH02_Arrays-and-Structures_2022_0213_4inOne.pdf
CH03_Stacks-and-Queues_2022_0213_4inOne.pdf
CH04_Lists_2022_0213_4inOne.pdf
CH05_Trees_2020_0913_4inOne.pdf
CH05-1_AVL Trees_2017_0909_4inOne.pdf
CH05-0_How to draw a BST_2016_0911_4inOne.pdf
CH06_Graphs_2022_0214_4inOne.pdf
CH07_Sorting_2022_0214_4inOne.pdf
Google Sites
Report abuse
Google Sites
Report abuse