Skip to content

Commit 2baeb7e

Browse files
Merge pull request #37 from Yash636261/main
basic operations in an array
2 parents ce61b86 + 88dca44 commit 2baeb7e

File tree

4 files changed

+121
-0
lines changed

4 files changed

+121
-0
lines changed

CPP/array-2d/find_3rd_max.cpp

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
#include<iostream>
2+
using namespace std;
3+
void third(int arr[],int n){
4+
int first=arr[0];
5+
int j=0;
6+
for(int i=0;i<n;i++)
7+
{
8+
if(arr[i]>first)
9+
first=arr[i];
10+
}
11+
int second = INT_MIN;
12+
for (int i = 0; i < n; i++)
13+
if (arr[i] > second && arr[i] < first)
14+
second = arr[i];
15+
16+
int third = INT_MIN;
17+
for (int i = 0; i < n; i++)
18+
if (arr[i] > third && arr[i] < second)
19+
third = arr[i];
20+
cout<<third;
21+
}
22+
int main(){
23+
int arr[]={1,34,65,87,9,78};
24+
int n=sizeof(arr)/sizeof(arr[0]);
25+
third(arr,n);
26+
return 0;
27+
}

CPP/array-2d/find_max.cpp

Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
#include<iostream.h>
2+
using namespace std;
3+
void max(int arr[5])
4+
{
5+
int max[5];
6+
max[0]=0;
7+
int k=0;
8+
for(int i=0;i<5;i++)
9+
{
10+
if(arr[i]>max[k])
11+
max[k]=arr[i];
12+
}
13+
cout<<"maximum number is:"<<max[k];
14+
}
15+
int main(){
16+
int arr[5],i;
17+
cout<<"enter members of an array:"<<endl;
18+
for(i=0;i<5;i++)
19+
{
20+
cin>>arr[i];
21+
}
22+
max(arr);
23+
return 0;
24+
}

CPP/array-2d/find_triplet.cpp

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
2+
#include<iostream>
3+
using namespace std;
4+
void exp(int arr[],int n,int target){
5+
for(int i=0;i<n;i++){
6+
for(int j=0;j<n;j++){
7+
for(int k=0;k<n;k++){
8+
if(arr[i]+arr[j]+arr[k]==target){
9+
if(arr[i]<arr[j]&&arr[j]<arr[k]){
10+
cout<<"("<<arr[i]<<","<<arr[j]<<","<<arr[k]<<")"<<endl;
11+
}
12+
}
13+
}
14+
}
15+
}
16+
}
17+
int main(){
18+
int arr[]={2,7,4,0,9,5,1,3};
19+
int n=sizeof(arr)/sizeof(arr[0]);
20+
int target=6;
21+
exp(arr,n,target);
22+
return 0;
23+
}
24+
Footer
25+
© 2022 GitHub, Inc.
26+
Footer navigation
27+
Te

CPP/array-2d/rodate_array.cpp

Lines changed: 43 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,43 @@
1+
#include<iostream>
2+
using namespace std;
3+
4+
void rotate(int arr[],int n,int d)
5+
{
6+
int temp[n];
7+
int j=0;
8+
for(int i=d;i<n;i++)
9+
{
10+
temp[j]=arr[i];
11+
j++;
12+
}
13+
for(int i=0;i<d;i++)
14+
{
15+
temp[j]=arr[i];
16+
j++;
17+
}
18+
for(int i=0;i<n;i++)
19+
{
20+
arr[i]=temp[i];
21+
}
22+
}
23+
void print(int arr[ ],int n)
24+
{
25+
for(int i=0;i<n;i++){
26+
cout<<arr[i]<<endl;
27+
}
28+
}
29+
int main()
30+
{
31+
int n,i,d, arr[10];
32+
33+
cout << "\nPlease Enter the Array Size = ";
34+
cin >> n;
35+
cout<<"enter array elements:"<<endl;
36+
d=2;
37+
for(i=0;i<n;i++){
38+
cin>>arr[i];
39+
}
40+
rotate(arr,n,d);
41+
print(arr,n);
42+
return 0;
43+
}

0 commit comments

Comments
 (0)