-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathVectorsC++.cpp
119 lines (81 loc) · 1.91 KB
/
VectorsC++.cpp
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
// Vectors.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include <iostream>
#include <vector>
using namespace std;
void printIntVector(vector<int> v, string caption);
void addingVector(vector<int>& v, int addingItems);
int returnIndice(vector<int> v, int key);
void experiement01();
void experiement02();
int main()
{
//experiement01();
experiement02();
}
void experiement02()
{
vector<int> v{ 22, 11, 33, 44 };
vector<int> v1{ 22, 44, 55, 11 };
vector<int> v2{};
for (int i = 0; i < v.size(); i++)
{
int key = v[i];
int pos = returnIndice(v1, key);
int pos2 = returnIndice(v2, key);
if (pos >= 0 && pos2 == -1)
{
v2.push_back(key);
}
}
/*printIntVector(v, "this is v2");
printIntVector(v1, "this is v3");*/
printIntVector(v2, "this is v4 (common)");
;}
/*
void experiement01()
{
vector<int> v1{ 11, 22, 33, 44, 55 };
int addingItems = 1;
printIntVector(v1, "before modify");
addingVector(v1, addingItems);
printIntVector(v1, " after modify");
int pos = returnIndice(v1, 2);
if (pos == -1)
{
cout << "\nvalue not found\n";
}
else
cout << "\nfirst occurence found at " << pos << endl;
vector<int> v2{ 22, 11, 33, 44 };
vector<int> v3{ 22, 44, 55, 11 };
vector<int> v4{};
}
*/
void printIntVector(vector<int> v, string caption)
{
cout << "\n" << caption << "\t";
for (int i = 0; i < v.size(); i++)
{
cout << v[i] << ", ";
}
cout << endl;
}
void addingVector(vector<int>& v1, int addingItems)
{
for (int i = 0; i < v1.size(); i++)
{
v1[i] = v1[i] + addingItems;
}
}
int returnIndice(vector<int> v, int key)
{
for (int i = 0; i < v.size(); i++)
{
if (v[i] == key)
{
return i;
}
}
return -1;
}