Commit d1d363c

committed

Create Chpt10Notes.org

1 parent 61094b3 commit d1d363cCopy full SHA for d1d363c

File tree

+14

-0

lines changed

+14

-0

lines changed

Lines changed: 14 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,14 @@`
	`1`	`+* Sorting Algorithms`
	`2`	`+ >> Arranges the elements of a list in a certain order (descending or ascending)`
	`3`	`+ Output is a permutation or reordering of the input`
	`4`	`+ ** Often used for database algorithms and searches`
	`5`	`+`
	`6`	`+ * Classification of sorting algorithms`
	`7`	`+ ** By number of comparisons`
	`8`	`+ Best case is O(nlogn) and worst case is O(n^2)`
	`9`	`+`
	`10`	`+ * Internal sort:`
	`11`	`+ sort algorithms that use main memory exclusively during the sort called internal sorting. This alfgorithm assummes high speed random access to all memory`
	`12`	`+`
	`13`	`+ * External Sort:`
	`14`	`+ sorting algorithms that use external memory, during the sort.`

Comments

(0)