U E D R , A S I H C RSS

김동준/Project/Data_Structure_Overview/Chapter1

Array ADT

  // :  A include Array, i include index, x include item
  // j , size include integer
  Array Create(j, list) => return j  
                                          list i  i   j-tuple  item   .
  Item retrive(A, i) => if(i include index)
                        return  A  i  
                            else reutrn 
   Array Store(A,i,x) => if( i include index)
                         return (i,x)    A.
                         else return 
C
  int list[5], or *plist[5]

  #define MAX_SIZE 100
  float sum(folat [], int);
  float input[MAX_SIZE], answer;
  void main(void) {
    int i;
    for(i = 0; i < MAX_SIZE; i++) {  input[i] = i; }
    answer = sum(input, MAX_SIZE);
    printf("The sum is: %f\n", answer);
  }
  float sum(float list[], int n) {
    int i;
    float tempsum = 0;
    for(i = 0; i < n; i++) { tempsum += list[i]; }
    return tempsum;
  }
1, 2 .
. 2

int** make2dArray(int rows, int cols) {
 int **x, i;
 MALLOC(x, rows * sizeof (*x));
 for(i = 0; i < rows; i++) { MALLOC(x[i], cols * sizeof(**X)); }
 return x;
}
Main
Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:28:49
Processing time 0.0120 sec