Algorithms: Difference between revisions
Jump to navigation
Jump to search
Line 10: | Line 10: | ||
* Lists (single linked and double linked) | * Lists (single linked and double linked) | ||
* Stack | * Stack | ||
* Queue | * Queue. Difference between list and queue. | ||
* Sorting | * Sorting | ||
** Comparison Sort | ** Comparison Sort. Comparison sort algorithm class. Know that comparison sort cannot do better than n ln n. Proof in a separate article. | ||
** Non-comparison Sort | ** Non-comparison Sort | ||
** Sorting algorithms characteristics (in-place, stability) | ** Sorting algorithms characteristics (in-place, stability) | ||
* Algorithm complexity, Bounds. Understand and document O, Omega and Theta notations. Perform complexity analysis on all the algorithms I examine. Expected running time, worst-case running time. Average case running time. | * Algorithm complexity, Bounds. Understand and document O, Omega and Theta notations. Perform complexity analysis on all the algorithms I examine. Expected running time, worst-case running time. Average case running time. | ||
* Iteration and recursion – fundamentally different approaches. | |||
* Set | * Set | ||
* Map | * Map | ||
Line 21: | Line 22: | ||
* Distributed Hash Map | * Distributed Hash Map | ||
* Trees | * Trees | ||
** Binary Trees | ** Binary Trees. Binary tree height. | ||
*** Sorting trees. | *** Sorting trees. Difference between a binary search tree and a red-black tree. | ||
** BTrees | ** BTrees | ||
* Tree walking algorithms. Difference between depth first and breadth first. | * Tree walking algorithms. Difference between depth first and breadth first. | ||
Line 29: | Line 30: | ||
* Matrix multiplication (NOKB and code). | * Matrix multiplication (NOKB and code). | ||
* lg and ln notation. Link from the [[Mathematics]] main page. | * lg and ln notation. Link from the [[Mathematics]] main page. | ||
* Random variable analysis. Indicator random variable. | |||
Probability Distribution. | |||
* Consider starting upside down, with the bottom (math) sections, and NOKB concepts from them first. | |||
* [[Mathematics]]: Understand and document induction. | |||
* Need to understand aggregate analysis Section 17.1 | |||
=Organizatorium= | =Organizatorium= |
Revision as of 01:58, 4 August 2018
External
Internal
Overview
- Arrays.
- Lists (single linked and double linked)
- Stack
- Queue. Difference between list and queue.
- Sorting
- Comparison Sort. Comparison sort algorithm class. Know that comparison sort cannot do better than n ln n. Proof in a separate article.
- Non-comparison Sort
- Sorting algorithms characteristics (in-place, stability)
- Algorithm complexity, Bounds. Understand and document O, Omega and Theta notations. Perform complexity analysis on all the algorithms I examine. Expected running time, worst-case running time. Average case running time.
- Iteration and recursion – fundamentally different approaches.
- Set
- Map
- Hash Map
- Distributed Hash Map
- Trees
- Binary Trees. Binary tree height.
- Sorting trees. Difference between a binary search tree and a red-black tree.
- BTrees
- Binary Trees. Binary tree height.
- Tree walking algorithms. Difference between depth first and breadth first.
- Graphs
- Graph algorithms
- Matrix multiplication (NOKB and code).
- lg and ln notation. Link from the Mathematics main page.
- Random variable analysis. Indicator random variable.
Probability Distribution.
- Consider starting upside down, with the bottom (math) sections, and NOKB concepts from them first.
- Mathematics: Understand and document induction.
- Need to understand aggregate analysis Section 17.1
Organizatorium
- A data structure is an arrangement of data in computer's memory or external storage. Data structures include arrays, linked lists, stacks, binary trees, hash tables, etc. Algorithms manipulate the data in these structures in various ways.
- Array
- Directed Acyclic Graph
- Associative Array
- Map
- Tree
- Consistent Hashing
- https://en.wikipedia.org/wiki/Big_O_notation
- https://probablydance.com/2018/06/16/fibonacci-hashing-the-optimization-that-the-world-forgot-or-a-better-alternative-to-integer-modulo
- http://infotechgems.blogspot.com/2011/11/java-collections-performance-time.html