TADM2E 4.41 - Revision history

Matt: Undo revision 1093 by FuckMatt (talk)

2020-08-01T00:45:39Z

Undo revision 1093 by FuckMatt (talk)

FuckMatt: Redirected page to UNTV

2020-07-31T10:16:49Z

Redirected page to UNTV

Matt: Undo revision 791 by EthanGamer (talk)

2020-07-23T13:37:29Z

Undo revision 791 by EthanGamer (talk)

EthanGamer: Blanked the page

2020-07-14T01:58:23Z

Blanked the page

Joky at 21:52, 30 December 2016

2016-12-30T21:52:53Z

Algowikiadmin: Recovering wiki

2014-09-11T18:14:20Z

Recovering wiki

New page

Merge sort:
*Advantages: suitable for linked list, suitable for external sort.
*Disadvantages: need extra buffer holding the merged data.

Insertion/Selection sort:
*Advantages: easy to implement.
*Disadvantages: too slow and become impractical when data is huge.

Heap sort:
*Advantages: don't need recursion. Suitable for large data.
*Disadvantages: usually slower than merge sort and quick sort.

Quick sort:
*Advantages: practical fastest.
*Disadvantages: recursive, worst case too slow.

← Older revision		Revision as of 10:16, 31 July 2020
Line 1:		Line 1:
−	~~Merge sort:~~	+	#REDIRECT [[UNTV]]
−	*Advantages: suitable for linked list, suitable for external sort.
−	*Disadvantages: need extra buffer holding the merged data (but for linked-list)
−
−	~~Insertion/Selection sort:~~
−	*Advantages: easy to implement.
−	*Disadvantages: too slow and become impractical when data is huge.
−
−	~~Heap sort:~~
−	*Advantages: don't need recursion. Suitable for large data.
−	*Disadvantages: usually slower than merge sort and quick sort.
−
−	~~Quick sort:~~
−	*Advantages: practical fastest.
−	*Disadvantages: recursive, worst case too slow.

← Older revision		Revision as of 01:58, 14 July 2020
Line 1:		Line 1:
−	~~Merge sort:~~
−	*Advantages: suitable for linked list, suitable for external sort.
−	*Disadvantages: need extra buffer holding the merged data (but for linked-list)

−	~~Insertion/Selection sort:~~
−	*Advantages: easy to implement.
−	*Disadvantages: too slow and become impractical when data is huge.
−
−	~~Heap sort:~~
−	*Advantages: don't need recursion. Suitable for large data.
−	*Disadvantages: usually slower than merge sort and quick sort.
−
−	~~Quick sort:~~
−	*Advantages: practical fastest.
−	*Disadvantages: recursive, worst case too slow.

← Older revision		Revision as of 00:45, 1 August 2020
Line 1:		Line 1:
−	~~#REDIRECT [[UNTV]]~~	+	Merge sort:
		+	*Advantages: suitable for linked list, suitable for external sort.
		+	*Disadvantages: need extra buffer holding the merged data (but for linked-list)
		+
		+	Insertion/Selection sort:
		+	*Advantages: easy to implement.
		+	*Disadvantages: too slow and become impractical when data is huge.
		+
		+	Heap sort:
		+	*Advantages: don't need recursion. Suitable for large data.
		+	*Disadvantages: usually slower than merge sort and quick sort.
		+
		+	Quick sort:
		+	*Advantages: practical fastest.
		+	*Disadvantages: recursive, worst case too slow.

← Older revision	Revision as of 13:37, 23 July 2020
Line 1:	Line 1:
	+	Merge sort:
	+	*Advantages: suitable for linked list, suitable for external sort.
	+	*Disadvantages: need extra buffer holding the merged data (but for linked-list)

	+	Insertion/Selection sort:
	+	*Advantages: easy to implement.
	+	*Disadvantages: too slow and become impractical when data is huge.
	+
	+	Heap sort:
	+	*Advantages: don't need recursion. Suitable for large data.
	+	*Disadvantages: usually slower than merge sort and quick sort.
	+
	+	Quick sort:
	+	*Advantages: practical fastest.
	+	*Disadvantages: recursive, worst case too slow.

@@ Line 1: / Line 1: @@
 Merge sort:
      *Advantages: suitable for linked list, suitable for external sort.
-     *Disadvantages: need extra buffer holding the merged data.
+     *Disadvantages: need extra buffer holding the merged data (but for linked-list)
 Insertion/Selection sort: