1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
puteri [66]
3 years ago
11

15 over square root 7 minus square root 2

Mathematics
1 answer:
ludmilkaskok [199]3 years ago
7 0

That's the answer...

You might be interested in
Patsy found a top on the clearance rack marked 60% off the original price. If the original price is $48, how much will Patsy sav
Arlecino [84]
If the top is $48 and it is 60% off you will multiply the cost by the decimal form of the sale percentage: 48*0.60= $28.80. This is the amount she will save and I think is the answer you are looking for.

If there is a follow up question asking for the final cost of the top you would find that by subtracting the amount saved from the original cost: 48.00-28.80=$19.20.
5 0
3 years ago
Read 2 more answers
John completes a long distance run at an average speed of 8.5 miles per hour. if it takes him 6 hours,how far did he run
Studentka2010 [4]
He ran 51 miles because
8.5 * 6 = 51.
6 0
2 years ago
Write a fraction greater than 1 for 6 using 9 as the denominator ​
svet-max [94.6K]
8/9. hope this helped
6 0
3 years ago
Explain why you do not have to do computing to solve 15×0×(13+7)
neonofarm [45]
The answer is 300 if you do the per enthuses first
5 0
3 years ago
"3. When we have two sorted lists of numbers in non-descending order, and we need to merge them into one sorted list, we can sim
iren [92.7K]

Answer:

Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)

Step-by-step explanation:

To understand better how we arrived at the aforementioned algorithm, we take it step by step

a, Construct a min-heap of the minimum elements from each of "k" lists.

The creation of this min-heap will cost O (k) time.

b) Next we run delete Minimum and move the minimum element to the output array.

Each extraction takes O (log k) time.

c) Then insert into the heap the next element from the list from which the element was extracted.

Now, we note that  since we extract n elements in total, the running time is

O (n log k+ k) = O (n log k).

So we can conclude that :

Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)

5 0
3 years ago
Other questions:
  • Please help me answer question number 3.
    12·1 answer
  • How many hours of digging does it take for the depth of the hole to reach -28 feet
    13·1 answer
  • at an amusement park, a person spends $30 on admission and food, and then goes on r number of rides that cost $2 each
    12·1 answer
  • Wastewater is filling barrels at the rate of 11 quarts per hour. The recycling facility picks up 120 full barrels on each trip,
    10·2 answers
  • OOI ANSWER THIS RQ~~~~~
    10·1 answer
  • Sheral got theses socres on her spelling test
    5·2 answers
  • The volume of a cone is 36 pi inches cubed. What is the volume of a cylinder with the same base and height as the cone?
    14·1 answer
  • Convert the decimal below into a rational number.
    13·1 answer
  • Is -1.4 greater than 0.3​
    5·1 answer
  • Order of operations 8x18/4+15
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!