org++
This commit is contained in:
parent
0ca7a0de1a
commit
d92d7511fe
33
cpp/najwieksza_liczba_w_tablicy/tab4.cpp
Normal file
33
cpp/najwieksza_liczba_w_tablicy/tab4.cpp
Normal file
@ -0,0 +1,33 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <conio.h>
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
int a[] = {5,18,7,9,2,1,11,8,2,3};
|
||||||
|
int i,k,max1,max2,n;
|
||||||
|
|
||||||
|
n = sizeof(a)/sizeof(a[0]);
|
||||||
|
max1 = a[0];
|
||||||
|
k = 0;
|
||||||
|
for(i=1; i<n; i++) {
|
||||||
|
if(a[i] > max1) {
|
||||||
|
max1 = a[i];
|
||||||
|
k = i;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
cout << "Najwiekszy element: " << max1 << endl;
|
||||||
|
cout << "Indeks najwiekszego elementu: " << k << endl;
|
||||||
|
|
||||||
|
max2 = a[0];
|
||||||
|
for(i=1; i<n; i++) {
|
||||||
|
if(i!=k && a[i] > max2) {
|
||||||
|
max2 = a[i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
cout << "Drugi najwiekszy element: " << max2 << endl;
|
||||||
|
|
||||||
|
system("pause");
|
||||||
|
return 0;
|
||||||
|
}
|
BIN
cpp/najwieksza_liczba_w_tablicy/tab4.exe
Normal file
BIN
cpp/najwieksza_liczba_w_tablicy/tab4.exe
Normal file
Binary file not shown.
Loading…
x
Reference in New Issue
Block a user