Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <time.h>
- #include <random>
- using namespace std;
- void bubbleSort(int* numbers, int length) {
- int temp = 0;
- for (int y = 0; y < length; y++) {
- for (int x = 0; x < length - y; x++) {
- if (numbers[x] > numbers[x + 1]) {
- int temp = numbers[x];
- numbers[x] = numbers[x + 1];
- numbers[x + 1] = temp;
- }
- }
- }
- }
- int main() {
- const int SIZE = 600;
- int numbers[SIZE];
- default_random_engine engine(time(0));
- uniform_int_distribution<int> random(1, 100);
- for (int x = 0; x < SIZE; x++)
- numbers[x] = random(engine);
- int newNumbers[SIZE];
- for (int x = 0; x < SIZE; x++)
- newNumbers[x] = numbers[x];
- int total = 0;
- int min = 100;
- int max = 1;
- for (int x = 0; x < SIZE; x++) {
- if (numbers[x] > max) max = numbers[x];
- if (numbers[x] < min) min = numbers[x];
- total += numbers[x];
- }
- float average = (float)total / SIZE;
- cout << "Minimum: " << min << endl;
- cout << "Maximum: " << max << endl;
- cout << "Average: " << average << endl;
- cout << "How many of: " << endl;
- int answer;
- cin >> answer;
- cin.get();
- int instances = 0;
- for (int x = 0; x < SIZE; x++)
- if (numbers[x] == answer)
- instances++;
- cout << instances << endl;
- int instancesOf[100];
- for (int x = 0; x < 100; x++)
- instancesOf[x] = 0;
- for (int x = 0; x < 600; x++)
- instancesOf[numbers[x] - 1]++;
- instances = 0;
- for (int x = 0; x < 100; x++)
- if (instancesOf[x] > instances)
- instances = x;
- cout << "Most instances: " << instances << endl;
- bubbleSort(numbers, SIZE - 1);
- int i = 0;
- for (int x = 0; x < SIZE; x++) {
- if (numbers[x] > i) {
- i++;
- cout << endl;
- }
- cout << numbers[x] << " ";
- }
- cout << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement