Search for a sign language term

Merge sort

Merge sort (or mergesort) is a divide and conquer algorithm for sorting a list of items. Merge sort is a stable sorting algorithm, while quicksort is not. It has a worst-case complexity of O(n*log(n)). Merge sort is also highly parallelizable. It can be used for solving the inversion counting problem.

Funding

This project has been co-funded with support from the European Commission. This communication reflects the views only of the author, and the Commission cannot be held responsible for any use which may be made of the information contained therein.
Project number: 2020-1-IT01-KA202-008386

Consortium

Istituto Dei Sordi Di Torino
Equalizent Schulungs Und Beratungs Gmbh
Associação Portuguesa de Emprego Apoiado
Fundacion Tecnologia Social
Emphasys Centre
“Budakov Films” EOOD
European Digital Learning Network
en_USEnglish
it_ITItalian de_ATGerman pt_PTPortuguese es_ESSpanish bg_BGBulgarian elGreek en_USEnglish