aboutsummaryrefslogtreecommitdiff
path: root/Lab1/Source.cpp
diff options
context:
space:
mode:
authorAsahel <[email protected]>2024-03-14 08:47:01 -0700
committerAsahel <[email protected]>2024-03-14 08:47:01 -0700
commit7e2a4a0d639b6c4bc0344ced4c9ce2b23cddeccb (patch)
treeb0db05ce8a0ed70353cf42146ffad959133bf96b /Lab1/Source.cpp
parentChanges (diff)
downloadlab-01-asahellt-7e2a4a0d639b6c4bc0344ced4c9ce2b23cddeccb.tar.xz
lab-01-asahellt-7e2a4a0d639b6c4bc0344ced4c9ce2b23cddeccb.zip
Implemented functionsHEADmain
Diffstat (limited to 'Lab1/Source.cpp')
-rw-r--r--Lab1/Source.cpp79
1 files changed, 79 insertions, 0 deletions
diff --git a/Lab1/Source.cpp b/Lab1/Source.cpp
index b3d8541..c7a8e98 100644
--- a/Lab1/Source.cpp
+++ b/Lab1/Source.cpp
@@ -27,6 +27,85 @@ int main() {
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;
}