GitHub - Andrei-Chiorian/merge_sort_algorithm: This is a sorting algorithm that uses the divide-and-conquer principle to sort collections of data. That is, it 'divides' a collection into smaller sub-parts, and 'conquers' the sub-parts by sorting them independently, then merges the sorted sub-parts.

Andrei-Chiorian / merge_sort_algorithm Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

This is a sorting algorithm that uses the divide-and-conquer principle to sort collections of data. That is, it 'divides' a collection into smaller sub-parts, and 'conquers' the sub-parts by sorting them independently, then merges the sorted sub-parts.