Answer:
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
char choice;
cout << setprecision(12) << endl;
while(true) {
int sign = 1;
double pi = 0;
cout << "Enter number of terms: ";
long n;
cin >> n;
for(long i = 1; i < n; i += 2) {
pi += sign/(double)i;
sign = -sign;
}
pi *= 4;
cout << "value of pi for n = " << n << " is " << pi << endl;
cout << "Do you want to try again(y or n)? ";
cin >> choice;
if(choice == 'n' || choice == 'N') {
break;
}
}
return 0;
}
Explanation:
Answer:
nah
Explanation:
is a lame game for lil kids
In the case above, the operation is not efficiently supported by heaps is Find.
<h3>What are heap operations?</h3>
The operation that are known to often use heaps are:
- Heapify
- Find-max (or Find-min)
- Insertion, etc.
Therefore, In the case above, the operation is not efficiently supported by heaps is Find.
See full question below
Which operation is not efficiently supported by heaps?
a. DeleteMin
b. Find
c. FindMin
d. Insert
e. all of the above are sufficiently supported
Learn more about operation from
brainly.com/question/24214198
#SPJ11
You put it in the skills and certifications section
