arrayLessons/main.cpp at master · brianmaclean/arrayLessons · GitHub

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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include <iostream>
#include <string>
#include <iomanip>
using namespace std;

int findLargest(int myArr[], int size);

int findSmallest(int myArr[], int size);

int findMiddle(int myArr[], int size);

int splitBuckets(int myArr[], int size);

int* makeSmallBucket(int myArr[], int size);

int main() {

	int size = 5;
	int myArr[] = { 1, 3, 7, 4, 5 };

	int * smallArr = makeSmallBucket(myArr, size);

	cout << smallArr[0] << " " << smallArr[1] << " " << smallArr[2] << endl;
	// 1 3 4

	return 0;
}

int findLargest(int myArr[], int size) {
	int largest = 0;
	for ( int i = 0; i < size; i++ ) {
		if ( myArr[i] > largest ) {
			largest = myArr[i];
		}
	}

	return largest;
}

int findSmallest(int myArr[], int size) {
	int smallest = myArr[0];
	for ( int i = 0; i < size; i++ ) {
		if ( myArr[i] < smallest ) {
			smallest = myArr[i];
		}
	}

	return smallest;
}

int findMiddle(int myArr[], int size) {
	int largest = findLargest(myArr, size);
	int smallest = findSmallest(myArr, size);

	int middle = largest - smallest;
	middle /= 2;
	middle += smallest;

	return middle;
}

int * makeSmallBucket(int myArr[], int size) {
	int middle = findMiddle(myArr, size);
	int newArr[size];
	int arrCounter = 0;

	for ( int i = 0; i < size; i++ ) {
		if ( myArr[i] <= middle ) {
			newArr[arrCounter] = myArr[i];
			arrCounter++;
		}
	}

	return newArr;

}