《算法導論(第4版)》學習第 18 天，p83-p85 總結，總計 3 頁。

一、技術總結

1. Strassen algorithm(施特拉森算法)

2.矩陣

(1)矩陣表示法

If we wish to refer to matrices without specifically writing out all their entries, we will use uppercase A, B, C, and so on. In general, a?? will denote the entry of the matrix A that is in the ith row and the jth column. We will refer to this entry as the (i, j) entry of A. We will sometimes shorten this to A = (a??). Similarly, a matrix B may be referred to as (b??), a matrix C as (c??), and so on.

(2)dense matrix(密集矩陣) & sparse matrix(稀疏矩陣)、

Generally, we’ll assume that the matrices are dense, meaning that most of the n2 entries are not 0, as opposed to sparse, where most of the n2 entries are 0 and the nonzero entries can be stored more compactly than in an n × n array.

二、英語總結(生詞：0)

無。

關于英語的注解同步更新匯總到 https://github.com/codists/English-In-CS-Books 倉庫。

三、其它

今天沒有什么想說的。

四、參考資料

1. 編程

(1) Thomas H. Cormen，Charles E. Leiserson，Ronald L. Rivest，Clifford Stein，https://book.douban.com/subject/35591269/

2. 英語

(1) Etymology Dictionary：https://www.etymonline.com

(2) Cambridge Dictionary：https://dictionary.cambridge.org

歡迎搜索及關注：編程人(a_codists)