Question d’entretien chez Electronic Arts
Explain the merge sort algorithm
Réponses aux questions d'entretien
Utilisateur anonyme
9 févr. 2012
First divide the unsorted list into sub-lists, each containing 1 element (a list of 1 element is considered sorted). Next, repeatedly merge sublists to produce new sublists until there is only 1 sublist remaining. (This will be the sorted list.)
2