Question d’entretien chez Amazon

Heap Sorting. What data structure do you use to implement it? Time to access and sort. Code it.

Réponses aux questions d'entretien

Utilisateur anonyme

28 août 2012

Using an array, you know the child of a node by using the 2i+1 formula.

Utilisateur anonyme

22 oct. 2012

It depends on the size. It is better to implement it tree instead of array.