Assignment Mid Term
Assignment Mid Term
Initialization
#include<iostream>
using namespace std;
int main(){
int n;
cout<<"input size: ";
cin>>n;
int array[n];
cout<<"enter elements of an array:";
for(int i=0; i<n; i++){
cin>>array[i]; }
cout<<"Output:";
for(int i=0; i<n; i++){
cout<<array[i]<<" ";}}
2. Reversed.
3. Finding Minimum
#include<iostream>
using namespace std;
int main(){
int n;
cout<<"input size: ";
cin>>n;
int A[n];
cout<<"enter elements of an array:";
for(int i=0; i<n; i++){
cin>>A[i];}
cout<<"Output:"<<endl;
for(int i=0; i<n; i++){
cout<<"A["<<i<<"]="<<A[i]<<endl;
}}
#include<iostream>
using namespace std;
int main(){
int m,n, M[m][n];
cout<<"input array size:";
cin>>m>>n;
cout<<"Enter elements of an array:";
for(int i=0; i<m; i++){
for(int j=0; j<n; j++){
cin>>M[i][j];}}
cout<<"Output:";
for(int i=0; i<m; i++){
for(int j=0; j<n; j++){
cout<<M[i][j]<<" ";
}}}
7. Transpose
8. Encode
#include<iostream> cin>>j;
#include<string> string encoded=encode(s, j);
using namespace std; cout<<"Encoded
string encode(string s, int j) { string:"<<encoded<<endl;
for (int i=j;i<s.length();i=i+(j + 1)) { return 0;
s[i]=s[i]+2; }
}
return s;
}
int main(){
string s;
int j;
cout<<"Enter the string:";
getline(cin, s);
cout<<"the number of characters to
skip:";
9. Binary Search
10. Struct