John came up with an algorithm for some problem that runs in time O(n²log (n)), and Bill came up with an algorithm for the same problem that runs in time o(n²log (n)). Based on this information, which one would you choose? Why?

please fast its database

If there is a problem at your place of work, please list and briefly explain the five steps you plan to take to fix it.\

QUICK SQL REQUEST (beginner level...) Back at work on Monday morning, the Vice President of Purchasing asks you to help him with the analysis of in-process storage. He asks you to pull information regarding the number of products per storage location. The result of the query should show: - The name of the warehouse (Location) - The number of different products per storage location - The total quantity of products found at this storage location  - The average price of all products found at this storage location He mentions that for the moment he is only interested in the locations that have more than 50 distinct products because he wants to start inventorying the biggest locations first. Show the locations in order of smallest to largest number of distinct products.   My request is linked to the question but i'm having trouble executing it I would love to know how to do it, thanks in advance.