ingbeeni

ArrayListType is_in_list(ArrayListType *L,int val) { int i; int position = 0; ArrayListType T; T.length = 0; T.list[position] = L->list[position]; for(i=0 ; ilength; i++) { if(T.list[i] == val) { T.length++; return T; } T.length++; } T.length = -1; return T; }

/* * list.c * * Created on: 2014. 4. 2. * Author: CSE */ #include #include #define MAX_LIST_SIZE 100 typedef int element; typedef struct{ element list[MAX_LIST_SIZE]; int length; } ArrayListType; void error(char *message){ fprintf(stderr,"%s\n",message); exit(1); } void init(ArrayListType *L){ L->length = 0; } int is_empty(ArrayListType *L){ return L->length == 0; } int is_full(ArrayListType *L)..

#include#include#define ROWS 3#define COLS 3#define MAX_TERMS 7typedef struct {int row;int col;int value;} SparseMatrix; SparseMatrix SparseMatrixFind(SparseMatrix *a, int val){int i;SparseMatrix c1; for (i = 0; ivalue)return *a;elsea++; c1.row = -1;c1.col = -1;return c1;}int main(void){int value = 0; printf("값을 넣으세요 : ");fflush(stdout);scanf("%d", &value);SparseMatrix m1[7] = { { 0, 3, 7 }, { 1..