tvl-depot/scratch/deepmind/part_one/efficiency.org

* Sorting
** Merge:	O(n*log(n))
** Heap:	O(n*log(n))
** Insertion:	O(n^2)
** Quick:	O(n^2)
** Bubble:	O(n^2)
Create org table of sorting algorithms and their efficiency This is just a small org table that I created to help me Fun fact: In Emacs, you can insert literal TAB character by pressing `C-q TAB`. For creating tables, using TAB characters feels perfectly acceptable. Perhaps the TAB name comes from TABle. 2020-01-22 11:12:27 +01:00			`* Sorting`
			`** Merge: O(n*log(n))`
			`** Heap: O(n*log(n))`
			`** Insertion: O(n^2)`
			`** Quick: O(n^2)`
			`** Bubble: O(n^2)`