5.10.                                               149

double find_max(const twod& m)
{

int    i , j ;

double max = m.element_rval(0,0);

for (i =0; i < m.c_size(); ++i)
for (j = 0; j < m.r_size(); ++j)
if (m.element_rval(i, j) > max)
max = m.element_rval(i, j);

return max;

}

,  element_lval ()     .  
 ,   .

void transpose(twod& m)
{

int    i , j ;

double temp;

for (i =0; i < m.c_size() - 1 ; ++i)
for (j = i + 1; j < m.r_size(); ++j) {
temp = m.element_lval(i, j);

m.element_lval(i, j) = m.element_lval(j, i);

m.element_lval(j, i) = temp;

}

    ,    
  m,    lvalue.

5.10.  

         

:

class ch_stack {
private:

int top;

enum {max_len = 100, EMPTY = -1, FULL = max_len-l};

char s[max_len] ;

public:

void reset() {top = EMPTY; }

void push(char c) { top++; s[top] =c; }

char pop() { return s[top-]; }

char top_of() const { return s[top]; }

bool empty() const { return (top == EMPTY); }

bool full() const { return (top == FULL); }