Computer scienceAlgorithms and Data StructuresAlgorithmsArray algorithmsSorting algorithms

Heapsort

Theory

Serve fast

Report a typo

Ross is a mobile phone technician. He owns a small shop with limited space, but a large number of customers come to his shop every day. Thus, Ross has decided to serve the customers with fewer problems first, as they require less time. This way, there would be no crowd in his shop. Which type of heap does Ross use to serve his customers, considering the serving time?

Select one option from the list
___

Create a free account to access the full topic