Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <conio.h>
- const int T = 5;
- using namespace std;
- int main()
- {
- int Numbers [T] = {0, 100, 200, 300, 400};
- const int *pInt = Numbers;
- for (int nIndex = 0; nIndex < T; ++nIndex)
- cout << "Element [" << nIndex << "] = " << *(pInt + nIndex) << endl;
- cout << int Max(int *pInt);
- cout << int Min(int *pInt);
- getch();
- return 0;
- }
- int Max(int *pInt){
- int maksimum=0;
- for (int i=0;i<10;++i)
- {
- if (*(pInt+i)>maksimum)
- maksimum = *(pInt+i);
- return maksimum;
- }
- int Min(int *pInt)
- {
- int minimum=0;
- for (int i=0;i<10;++i)
- {
- if (*(pInt+i)>minimum)
- minimum = *(pInt+i);
- return minimum;
- }
- void odwracanie(int *pInt)
- {
- int tmp;
- int i;
- for(i=0; i<n/2; i++){
- tmp=*[pInt-i-1];
- *[pInt-i-1]=*pInt;
- *pInt=tmp;
- }
- return;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement