Abstract Data Structures
Thinking recursively[edit | edit source]
Subprogram statements[edit | edit source]
Recursive binary search[edit | edit source]
Quicksort[edit | edit source]
Abstract data structures[edit | edit source]
One-dimensional array is an liner array, but two-dimensional array is more like a plane. If we want to explain how long of an line is, we can said,"it has 6 meters long". If we want to explain how large of an plane is, we can said,"it has 6*6 meters large", or "36 meters square". So one-dimensional array has one parameter to represent (x), but two-dimensional array has 2 parameters to represent (x,y). Another, two-dimensional array can be considered as numbers of one dimensional array combine each other.
Two-dimensional array can be considered as an table, one parameter representing row and another parameter representing column. Using that two parameters to determine the location of an specific data. The notation is array[x][y] (x,y can be any integer number but should be within the range of parameter). The parameter (x,y) started with "0", data type is integer. Generally, one two-dimensional array only contain one type of data (int, char, long int) or one type of object (often defined by class), and the type is declared before.