Answer:
one billion (9 zeros) is being reached fast – 15 seconds. but to get to one trillion (12 zeros) – the difference is amazing – 4 hours and 10 minutes. Basically 1000 times more.
Explanation:
Explanation:
To determine whether a display driver or app is causing the problem,check to see if Task Manager flickers. ... Then, based on that information, you'll need to update, rollback, or uninstall your displ
यह निर्धारित करने के लिए कि क्या कोई डिस्प्ले ड्राइवर या ऐप समस्या पैदा कर रहा है, यह देखने के लिए जांचें कि क्या कार्य प्रबंधक फ़्लिकर करता है। ... फिर, उस जानकारी के आधार पर, आपको अपने डिस्प्ले को अपडेट, रोलबैक या अनइंस्टॉल करना होगा
i think this can help you
Answer:
The program to this question can be given as:
Program:
#include<iostream> //header file
using namespace std;
int main() //main method
{
int x[10],i,largest = 0,second_largest=0,n; //variable
cout << "Enter Number of elements :"; //message
cin>>n;
cout << "Insert array elements :"; //message
for(i=0;i<n;i++) //insert elements in array
{
cin >>x[i];
}
//Finding Largest element
for(i=0;i<n;i++)
{
if (x[i]>largest)
{
largest = x[i];
}
}
//finding second largset element
for(i=0;i<n;i++)
{
if (x[i]>second_largest)
{
if(x[i]==largest)
{
continue; //Ignoring largest in order to get second largest
}
second_largest=x[i];
}
}
//print value
cout <<"Largest Number:"<<largest<<endl;
cout <<"Second Largest Number:"<<second_largest;
return 0;
}
Output:
Enter Number of elements :5
Insert array elements :33
45
75
87
23
Largest Number:87
Second Largest Number:75
Explanation:
In the above program firstly we define the header file then we define the main method in the main method we define the array and other variables. We first input the number for the size of the array. Then we insert array elements after inserting array elements we search the largest number and the second largest number in the array. To search the largest number in the array we use the loop. To search the first largest number we define a condition that array is greater than the largest number and store the value into the largest variable. Then we check the second largest number in the array for this we use two conditions that are array is greater than the second largest number in this we use another condition that is array is equal to the largest number. If the inner condition is true then it will move forward and end of an inner condition. In the outer condition, the value will be stored on the second_largest variable all the conditions will be done inner the loop. At the last we print values.
What the hell is the point of this, just to waist people's time?
an application that distributes messages to subscribers on an electronic mailing list.
