Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <time.h>
- #include <iomanip>
- using namespace std;
- double alfa(double pole[], int DelkaPole);
- void napln(double pole[], int rozsah, int DelkaPole);
- void vypis(double pole[], int DelkaPole);
- void filtr(double pole[], double & alfa, int DelkaPole);
- void Serazeni(double pole[], int DelkaPole);
- int main()
- {
- const int N = 10;
- const int M = 100;
- double pole[N];
- double A;
- srand((unsigned)time(NULL));
- napln(pole,M,N);
- vypis(pole,N);
- A = alfa(pole,N);
- filtr(pole,A,N);
- vypis(pole,N);
- Serazeni(pole,N);
- vypis(pole,N);
- cout << "Promenna Alfa je: " << A << endl;
- system("PAUSE");
- }
- void napln(double pole[], int rozsah, int DelkaPole)
- {
- for(int i=0; i < DelkaPole; i++)
- {
- pole[i] = rand()%rozsah;
- }
- }
- void vypis(double pole[], int DelkaPole)
- {
- for(int i=0; i < DelkaPole; i++)
- {
- cout << setw(5) << pole[i];
- }
- cout << endl;
- }
- double alfa(double pole[], int DelkaPole)
- {
- /*---------Minimum----------
- double min = pole[0];
- for(int i = 0; i < DelkaPole; i++)
- {
- if(min > pole[i])
- min = pole[i];
- }
- return min;*/
- /*---------Maximum----------
- double max = pole[0];
- for(int i = 0; i < DelkaPole; i++)
- {
- if(max < pole[i])
- max = pole[i];
- }
- return max;*/
- /*---------Průměr----------*/
- double avg;
- double soucet = 0;
- for(int i = 0; i < DelkaPole; i++)
- {
- soucet += pole[i];
- }
- avg = (soucet/DelkaPole);
- return avg;
- }
- void filtr(double pole[], double & alfa , int DelkaPole)
- {
- for(int i = 0; i < DelkaPole; i++)
- {
- if(pole[i] > (alfa/2))
- pole[i] = 0;
- }
- }
- void Serazeni(double pole[], int DelkaPole)
- {
- double t;
- for(int i = DelkaPole-1; i >= 0; i--)
- for(int j = 1; j <= i; j++)
- if (pole[j-1] > pole[j])
- {
- t = pole[j-1];
- pole[j-1] = pole[j];
- pole[j] = t;
- };
- }
Add Comment
Please, Sign In to add comment