-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patharray.cpp
More file actions
61 lines (53 loc) · 1.27 KB
/
array.cpp
File metadata and controls
61 lines (53 loc) · 1.27 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include "array.hpp"
void random_Fill_ar(int* ar, int size, int min, int max){
srand(time(nullptr));
for (int i = 0; i < size; i++){
ar[i] = min + rand() % (max - min + 1);
}
}
void show_ar(int* ar, int size, char element){
for (int i = 0; i < size; i++){
std::cout << ar[i] << element;
}
std::cout << std::endl;
}
void show_Big_ar(int* ar, int size, char element){
int count;
for (int k = 0; k < size; k+=count){
for (int i = k; (i < 9+k) && ar[i]==ar[i+1]; i++){
std::cout << ar[i] << element;
}
std::cout << ar[k] << element;
count = get_Count_Number(ar, size, ar[k]);
if (count > 10)
std::cout << "- " << count-10;
std::cout << std::endl;
}
std::cout << std::endl;
}
void swap(int &a, int &b){
int c = b;
b = a;
a = c;
}
int max_ind(int* ar, int left_front, int right_front){
int maxx = left_front;
for (int i = left_front; i < right_front; i++){
if (ar[i] > ar[maxx])
maxx = i;
}
return maxx;
}
int min_ind(int* ar, int left_front, int right_front){
int minn = left_front;
for (int i = left_front; i < right_front; i++){
if (ar[i] < ar[minn])
minn = i;
}
return minn;
}
int get_Count_Number(int* ar, int size, int number){
int count = 0;
for(int i = 0; i < size; count+=(ar[i]==number), i++);
return count;
}