Assignment-3
Assignment-3
Experiment – 1
A. #include <iostream>
arr[pos] = val;
( * n) ++;
int main()
int n;
cin >> n;
int arr[n];
int pos=0;
int val;
cout << "Enter the value of element: ";
return 0;
B. #include <iostream>
arr[pos] = val;
( * n) ++;
int main()
int n;
cin >> n;
int arr[n];
int pos=n;
int val;
return 0;
C. #include <iostream>
}
arr[pos] = val;
( * n) ++;
int main()
int n;
cin >> n;
int arr[n];
int pos;
cout << "Enter the position at which you want yo insert and element: ";
int val;
}
return 0;
Experiment – 2
#include <iostream>
for(int i=0;i<n;i++)
if(arr[i]==target)
return true;
return false;
int main()
int n;
cin >> n;
int arr[n];
for(int i=0;i<n;i++)
int target;
else
return 0;
B.
#include <iostream>
int start=0;
int end=n;
int mid=(start+end)/2;
while(start<end)
if(target>mid)
start=mid+1;
else if(target<mid)
end=mid-1;
}
else if(target==mid)
return true;
mid=(start+end)/2;
return false;
int main()
int n;
cin >> n;
int arr[n];
for(int i=0;i<n;i++)
int target;
if(Binarysearch(arr,n,target))
}
else
return 0;
C. #include <iostream>
int main()
int n;
cin >> n;
int arr[n];
for(int i=0;i<n;i++)
int index;
get(arr,n,index);
return 0;
D.
#include <iostream>
arr[index]=no;
int main()
int n;
cin >> n;
int arr[n];
for(int i=0;i<n;i++)
int no;
int index;
for(int i=0;i<n;i++)
return 0;
E.
#include <iostream>
for(int i=0;i<n;i++)
if(arr[i]>a)
a=arr[i];
return a;
int main()
int a=INT_MIN;
int n;
int arr[n];
for(int i=0;i<n;i++)
return 0;
F.
#include <iostream>
for(int i=0;i<n;i++)
if(arr[i]<a)
a=arr[i];
return a;
int main()
int a=INT_MAX;
int n;
cout <<"Enter length: ";
cin >> n;
int arr[n];
for(int i=0;i<n;i++)
return 0;
G. #include<iostream>
arr[n - 1] = 0;
}
int main() {
int n;
cin >> n;
int arr[n];
shiftLeft(arr, n);
printArray(arr, n);
return 0;
H. #include<iostream>
if (n == 0) return;
}
arr[n - 1] = firstElement;
int main() {
int n;
cin >> n;
int arr[n];
rotateLeft(arr, n);
printArray(arr, n);
return 0;
Experiment – 3
A.
#include<iostream>
int main()
int n;
cin >> n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(i+j>n-2)
B.
#include<iostream>
using namespace std;
int main()
int n;
cin >> n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(i+j+1<n)
else
C.
#include<iostream>
int main()
{
int n;
cin >> n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(i+j>n-1)
else
D. #include<iostream>
int main()
int n;
cin >> n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(j>=i)
else
E.
#include <iostream>
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
return 0;
F.
#include <iostream>
int main() {
int n;
cin >> n;
for (int i = n; i >= 1; i--)
return 0;
G.
#include <iostream>
int main() {
int n;
cin >> n;
}
cout << endl;
return 0;
H. #include <iostream>
int main() {
int n;
cin >> n;
return 0;
I. #include <iostream>
int main() {
int n;
cin >> n;
return 0;
}
J. #include <iostream>
int main() {
int n;
cin >> n;
return 0;
K.
#include <iostream>
int main() {
int n;
cin >> n;
return 0;
L.
#include<iostream>
int num = 1;
num =i;
int main() {
int n;
cin >> n;
printRotatedPyramid(n);
return 0;
M. #include<iostream>
using namespace std;
void printPalindromeTriangle(int n) {
cout << k;
cout << l;
int main() {
int n;
cin >> n;
printPalindromeTriangle(n);
return 0;
}
N. #include<iostream>
void printAlphabetPyramid(int n) {
cout << char('A' + i - 1) << " "; // Print the letter for the row
int main() {
int n;
cin >> n;
printAlphabetPyramid(n);
return 0;
}
O.
#include<iostream>
void printAlphabetPyramid(int n)
int num=0;
num ++;
int main() {
int n;
cin >> n;
printAlphabetPyramid(n);
return 0;