-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArray.cpp
More file actions
84 lines (73 loc) · 1.95 KB
/
Array.cpp
File metadata and controls
84 lines (73 loc) · 1.95 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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#include<iostream>
#include <climits>
using namespace std;
//Pass by reference
// void changeArr(int arr[], int size){
// cout<<"in function\n";
// for (int i = 0; i < size; i++){
// arr[i] = 2*arr[i];
// }
// }
//Linear search
// int search(int arr[], int size, int target){
// for (int i = 0; i < size; i++){
// if (arr[i] == target){
// return i;
// }
// }
// return -1;
// }
//Reverse an array
void reverse(int arr[], int size){
int start = 0, end = size-1;
while (start < end){
swap(arr[start], arr[end]);
start++;
end--;
}
}
int main(){
//initialization of array
// int num[] = {4,45,12,-978,05};
// int size = 5;
// cout<< marks[0]<<endl;
// cout<< marks[1]<<endl;
// cout<< marks[2]<<endl;
// cout<< marks[3]<<endl;
// cout<< marks[4]<<endl;
//Loops on array: 0 to size-1
// for (int i = 0; i < size; i++){
// cout<< marks[i] <<endl;
// }
//Que: Find smallest / largest
// int smallest = INT_MAX;
// int largest = INT_MIN;
// for (int i = 0; i < size; i++){
// smallest = min(num[i] , smallest);
// largest = max(num[i] , largest);
// }
// cout<<"Smallest = "<<smallest<<endl;
// cout<<"Largest = "<<largest<<endl;
//Pass by reference
// int arr[] = {1, 2, 3};
// changeArr(arr, 3);
// cout<<"in main\n";
// for (int i = 0; i < 3; i++){
// cout<< arr[i] << " ";
// }
// cout<<endl;
//Linear search
// int arr[] = {4, 2, 7, 8, 1, 2, 5};
// int size = 7;
// int target = 50;
// cout<< search(arr, size, target) << endl;
//Reverse an array
int arr[] = {4, 2, 7, 8, 1, 2, 5};
int size = 7;
reverse(arr, size);
for (int i = 0; i < size; i++){
cout<< arr[i] << " ";
}
cout<<endl;
return 0;
}