This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revision | |||
notes:discrete:fall2023:projects:mor0 [2023/11/15 17:53] – [Why Use Recursion Instead of a Loop?] walley | notes:discrete:fall2023:projects:mor0 [2023/11/16 01:24] (current) – [Matrix] cfoster8 | ||
---|---|---|---|
Line 13: | Line 13: | ||
Like arrays, Matrices are fixed in size. You allocate the memory for it when created and it cannot be changed. | Like arrays, Matrices are fixed in size. You allocate the memory for it when created and it cannot be changed. | ||
+ | In theory, a matrix can have as many dimensions as you want. As many times as you can nest an array in an array, a matrix of that many dimensions can be created. Because that's all a matrix is, at least this type of matrix, an array of arrays to the nth degree. | ||
=====Recursion===== | =====Recursion===== | ||
The concept of recursion is actually simple but implementing it is more challenging than you might think. Recursion works by creating a function that calls itself until it hits a base case to end/ | The concept of recursion is actually simple but implementing it is more challenging than you might think. Recursion works by creating a function that calls itself until it hits a base case to end/ |