Answer:
D. O(NlogN)
Explanation:
The computation of the overall algorithm cost is as follows:
Given that
O(logN) + O(N) × O(logN) + 1
In the case of complexity we considered the high order that dominates the other terms
Thus, that term would be
O(N) × O(logN)
It could be rewrite as
O(NlogN)
Hence, the correct option is D.
All the other options are wrong
Answer:
net use X: \\SERVER\Share
Explanation:
1. Connect securely to the remote computer or ensure you have access to it on the network
2. then follow the step below:
Where X: is the drive letter you wish to map the share to, and \\SERVER\Share is the UNC path to the share. This should make the share visible in My Computer and the command line as well like all other shares mapped through the GUI.
In order to later disconnect the share, you would use
net use X: /delete
Answer:
spreadsheets
Explanation:
every company uses spreadsheets because they are used to list and organize data easily
1.Creativity
2.Leadership
3.Attention to detail
5.Enjoyment to learning new things!
6.Vision
No Problem!
Answer:
#include <iostream>
using namespace std;
int * reverse(int a[],int n)//function to reverse the array.
{
int i;
for(i=0;i<n/2;i++)
{
int temp=a[i];
a[i]=a[n-i-1];
a[n-i-1]=temp;
}
return a;//return pointer to the array.
}
int main() {
int array[50],* arr,N;//declaring three variables.
cin>>N;//taking input of size..
if(N>50||N<0)//if size greater than 50 or less than 0 then terminating the program..
return 0;
for(int i=0;i<N;i++)
{
cin>>array[i];//prompting array elements..
}
arr=reverse(array,N);//function call.
for(int i=0;i<N;i++)
cout<<arr[i]<<endl;//printing reversed array..
cout<<endl;
return 0;
}
Output:-
5
4 5 6 7 8
8
7
6
5
4
Explanation:
I have created a function reverse which reverses the array and returns pointer to an array.I have also considered edge cases where the function terminates if the value of the N(size) is greater than 50 or less than 0.
