Frage im Vorstellungsgespräch bei Electronic Arts

Explain the merge sort algorithm

Antworten zu Vorstellungsgespräch

Anonym

9. Feb. 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

Anonym

9. Okt. 2010

c++