Answer:
The element she can create to increase efficiency for these searches is:
Search Folder
Explanation:
The reasons behind this are that index in the first place indexes by themselves don't facilitate the job of looking quickly at a certain e-mail. Because they show the user all of them. Second, outlook rules are certain guidelines that the user can program to group certain emails and send them to certain folders. However, they don't play a crucial part in quick searches. We have two options that could make this: instant search of folder search. Instant search works by general categories, of emails, events, and contacts. But search folders give the user certain characteristics the emails can have so the user can choose which emails to see. Thus, this is the correct answer.
Answer:
#include <stdlib.h>
#include <time.h>
#include<iostream.h>
int main(void) {
int seedVal = 0;
seedVal = 4;
srand(seedVal);
/* Solution*/
cout<<rand() % 149 + 100<<endl;
cout<<rand() % 149 + 100<<endl;
return 0;
}
Explanation:
We start with the required include statements to enable use of srand, rand and time functions. I have also added iostream library to use "cout" function.
After that, the seed is initialized using srand(). And then the two rand functions are called with ranges including and between 100 and 149, and printed out.
Return them they are probably defective or turn ur media volume all the way down.
The below code will help you to solve the given problem and you can execute and cross verify with sample input and output.
#include<stdio.h>
#include<string.h>
int* uniqueValue(int input1,int input2[])
{
int left, current;
static int arr[4] = {0};
int i = 0;
for(i=0;i<input1;i++)
{
current = input2[i];
left = 0;
if(current > 0)
left = arr[(current-1)];
if(left == 0 && arr[current] == 0)
{
arr[current] = input1-current;
}
else
{
for(int j=(i+1);j<input1;j++)
{
if(arr[j] == 0)
{
left = arr[(j-1)];
arr[j] = left - 1;
}
}
}
}
return arr;
}
