- stable sorting algorithms maintain the relative order of records with equal keys
- A comparison sort examines the data only by comparing two elements with a comparison operator
- Many integer sorting algorithms are based on the assumption that the key size "n" is large enough that all entries have unique key values, and hence that n << 2k, where << means "much less than."
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| """This would outputs | |
| x | |
| True | |
| __main__ | |
| False | |
| """ | |
| import x | |
suzaku
/ notes_on_sorting.md
Created
October 3, 2012 01:57
suzaku
/ notes_on_big_o_notation.md
Created
October 2, 2012 14:13
- different functions with the same growth rate may be represented using the same O notation.
- If f(x) is a sum of several terms, the one with the largest growth rate is kept, and all others omitted.
- If f(x) is a product of several factors, any constants (terms in the product that do not depend on x) are omitted.
-
Simple Graph
-
Undirected
-
has no loops
-
no more than one edge between any two different vertices
-
Regular Graph
- each vertex has the same number of neighbors
-
Complete Graph
-
each pair of vertices has an edge connecting them
-
In confronting complex situations, no single model can capture everything. Thus, we need to bring several of models to bear, not just one
-
as powerful as models may be, they’re only guides to thinking. We have to maintain contact with reality.
NewerOlder