aboutsummaryrefslogtreecommitdiff
path: root/Lab1/Source.cpp
blob: c7a8e98b2606770f85afd482616ace76e1a4e0e7 (plain) (blame)
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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
//Name: Asahel Lopez
//Date: 2/16/24
//Class: CST116
//Assignment: Lab 1

#include <iostream>
#include <array>
#include <vector>
int main() {

	int myArray[12000];

	for (int i = 0; i < 12000; ++i) {
		myArray[i] = 0;
	}


	std::array<int, 12000 > myArray;

	for (int i = 0; i < 12000; ++i) {
		myArray[i] = 0;
	}


	std::vector<int>myVector(12000);
	for (int i = 0; i < 12000; ++i) {
		myVector[i] = 0;
	}

	const int numElements = 12000;
	std::vector<int>
		List(numElements);

	void PrintContainer(const int (&arr)) {

		for (size_t i = 0; ++i) {
			cout << arr[i] << " ";
		}
		std::cout << std::endl;
	}

	void PrintContainer(const std::array& container) {
		for (const auto& element : container) {
			cout << element << " ";
		}
		cout << endl;
	}

	void PrintContainer(const std::vector& container) {
		for (const auto& element : container) {
			cout << element << " ";
		}
		cout << endl;
	}

	void PrintContainer(const std::list& container) {
		for (const auto& element : container) {
			cout << element << " ";
		}
		cout << endl;
	}

	int fibonacci(int n, int arr[]) {
		if (n <= 1)
			return n;

		arr[0] = 0;
		arr[1] = 1;

		for (int i = 2; i <= n; ++i)
			arr[i] = arr[i - 1] + arr[i - 2];

		return arr[n];
	}

	int fib(array<int, n>& fibarray) {
		fibarray[0] = 0;
		fibarray[1] = 1;
		
		for (size_t i = 2; i < N; ++i)

			fibArray[i] = fibarray[i - 1] + fibArray[N - 1];

	}

	fibVector(int) {
		vector<int> fibVector(n + 1);

		fibVector[0] = 0;
		fibVector[1] = 1;

		for (int i = 2; i <= n; ++i)
			fibVector[i] = fibVector[i - 1] + fibVector[i - 2];
		return fibVector

	}

	fibList(int) {
		list<int> fibList;
		fibList[0] = [0];
		fibList[1] = [1];

		for (int i = 2; i <= n; ++i)

			return fibList;
	}


	return 0;
}