Merge sort - Revision history

Savoundg at 03:23, 22 October 2020

2020-10-22T03:23:12Z

← Older revision		Revision as of 03:23, 22 October 2020
Line 1:		Line 1:
	Merge sort is a divide-and-conquer recursive sorting algorithm.		Merge sort is a divide-and-conquer recursive sorting algorithm.

	First, the algorithm divides the array to sort into two sub-arrays until the sub-arrays contain only one element. Then, ~~the~~ each pair of sub-arrays are merged in the correct order. To merge the sub-arrays, the algorithm go through both sub-arrays in the same time.		First, the algorithm divides the array to sort into two sub-arrays until the sub-arrays contain only one element. Then, each pair of sub-arrays are merged in the correct order. To merge the sub-arrays, the algorithm go through both sub-arrays in the same time.

	== Resources ==		== Resources ==

2020-10-22T03:23:00Z

← Older revision		Revision as of 03:23, 22 October 2020
Line 1:		Line 1:
	Merge sort is a divide-and-conquer recursive sorting algorithm.		Merge sort is a divide-and-conquer recursive sorting algorithm.

	First, the algorithm divides the array to sort into to sub-arrays until the sub-arrays contain only one element. Then, the each pair of sub-arrays are merged in the correct order. To merge the sub-arrays, the algorithm go through both sub-arrays in the same time.		First, the algorithm divides the array to sort into two sub-arrays until the sub-arrays contain only one element. Then, the each pair of sub-arrays are merged in the correct order. To merge the sub-arrays, the algorithm go through both sub-arrays in the same time.

	== Resources ==		== Resources ==

2018-05-30T06:52:11Z

← Older revision		Revision as of 06:52, 30 May 2018
Line 1:		Line 1:
	Merge sort is a divide-and-conquer sorting algorithm.		Merge sort is a divide-and-conquer recursive sorting algorithm.

			First, the algorithm divides the array to sort into to sub-arrays until the sub-arrays contain only one element. Then, the each pair of sub-arrays are merged in the correct order. To merge the sub-arrays, the algorithm go through both sub-arrays in the same time.

	== Resources ==		== Resources ==

2018-05-28T04:53:04Z

← Older revision		Revision as of 04:53, 28 May 2018
Line 1:		Line 1:
	~~Mergesort~~ is a divide-and-conquer ~~sort~~ algorithm.		Merge sort is a divide-and-conquer sorting algorithm.

	== Resources ==		== Resources ==

2018-05-28T04:52:21Z

Savoundg moved page Mergesort to Merge sort without leaving a redirect

← Older revision	Revision as of 04:52, 28 May 2018
(No difference)

2018-05-28T04:47:56Z

← Older revision		Revision as of 04:47, 28 May 2018
Line 1:		Line 1:
			Mergesort is a divide-and-conquer sort algorithm.

	== Resources ==		== Resources ==
	{\| class="wikitable"		{\| class="wikitable"

2018-05-27T22:57:17Z

Created page with "== Resources == {| class="wikitable" ! |- |https://en.wikipedia.org/wiki/Merge_sort |}"

New page

== Resources ==
{| class="wikitable"
!
|-
|https://en.wikipedia.org/wiki/Merge_sort
|}