.


:




:

































 

 

 

 


.

++ . , , .

int a[10]; 10, .. 10 [0], a[1],..., a[9].

a[i] i- . pa int, .. int *pa; pa=&a[0]; pa ; , [0].

x=*pa;

a[0] . , +1 , +i - i- , -i - i- . , [0], *(+1) [1], pa+i - [i], a *(pa+i) - a[i].

. " 1 ", , , +1 , +i - i- .

. - .

pa=&a[0];

pa . , , =&a[0]; :

=a;

( ) , [i] *(a+i). a[i], * (+i); . , , & &a[i] a+i , .. i- . , - , , .. [i] *(+i). , .

, , . - , = ++. , = ++ .

, . ( , , ).

#include <iostream.h>void main(){ const int ArraySize=10; // int A[ArraySize], *p, i; //: A ArraySize int; p int; // i int p=A; /* p (, )*/ for (i=0; i<ArraySize; i++) { cout<<"Do enter A["<<i<<"] element -->"; cin>>p[i]; //p[i] - : *(p+i), *(A+i) A[i] } int min=*p, index=0; for (i=1;i<ArraySize;i++) if (min>*(p+i)) { min=*(p+i); //*(p+i) - : p[i], *(A+i) A[i] index=i; } cout<<"\n\nMinimum was found!\nValue = "<<min<<"\nIndex ="<<index<<endl; // }

 

 

:

  1. . , (.. , , , ).
  2. . , (.. , ).
  3. , : [n] B[m]. C[n+m], , .
  4. : [n] B[m]. , ;
  5. : [n] B[m]. , ;
  6. : [n] B[m]. , A, B;
  7. : [n] B[m]. , B, A;
  8. : [n] B[m]. , A B, (


<== | ==>
(Artropoda). : /Artropoda/. | Windows. Plug and Play, Drag and Drop, Clipboard, Recycle Bin, OLE, , .
:


: 2016-12-18; !; : 282 |


:

:

, .
==> ...

795 - | 769 -


© 2015-2024 lektsii.org - -

: 0.012 .