notes

Personal notes
git clone git://git.laack.co/notes.git
Log | Files | Refs

Algorithms.md (3850B)

      1 # Algorithms Index
      2 
      3 This is an index for links to notes taken about algorithms. These are CS related algorithms and not related to machine learning (see [Machine Learning](MachineLearning.md) for that).
      4 
      5 ## Links
      6 
      7 - [Monte Carlo Method](MonteCarloMethod.md)
      8 - [Las Vegas Method](LasVegasMethod.md)
      9 - [Perlin Noise](PerlinNoise.md)
     10 - [Fisher Yates Shuffle](FisherYatesShuffle.md)
     11 
     12 #### CSCI 303 (DS&A)
     13 
     14 Ch 0 (algorithms):
     15 
     16 - [Algorithm](Algorithm.md)
     17 - [Task](Task.md)
     18 - [Time Complexity](TimeComplexity.md)
     19 - [Counting Principle](CountingPrinciple.md)
     20 - [Multi Valued Function](MultiValuedFunction.md)
     21 - [Collection](Collection.md) 
     22 - [Function Notation](FunctionNotation.md)
     23 - [Operator Notation](OperatorNotation.md)
     24 
     25 Ch 1 (stacks and queues):
     26 
     27 - [Abstract Data Type](AbstractDataType.md)
     28 - [Stack](Stack.md)
     29 - [Queue](Queue.md)
     30 
     31 Ch 2 (Big-O and Asymptotic Complexity):
     32 
     33 - [Big ONotation](BigONotation.md)
     34 - [Asymptotic Notation](AsymptoticNotation.md) (include asymptotic complexity class)
     35 - [Big Theta Notation](BigThetaNotation.md)
     36 - [Linearithmic](Linearithmic.md)
     37 
     38 Ch 3 (state analysis):
     39 
     40 - [State Analysis](StateAnalysis.md)
     41 - [Stirlings Formula](StirlingsFormula.md)
     42 
     43 Ch 4 (graphs):
     44 
     45 - [Graphs](Graphs.md)
     46 - [Walk](Walk.md)
     47 - [Path](Path.md)
     48 - [Cycle](Cycle.md)
     49 - [Connected](Connected.md)
     50 - [Tree](Tree.md)
     51 - [Adjacency Matrix](AdjacencyMatrix.md) (nxn matrix with true and false for a_i,j)
     52 - [Digraph](Digraph.md)
     53 - [Multigraph](Multigraph.md)
     54 - [Loop](Loop.md) (different than cycle)
     55 - [Sparse](Sparse.md)
     56 - [Subgraph](Subgraph.md)
     57 - [Connected Component](ConnectedComponent.md)
     58 - [Weighted Graph](WeightedGraph.md)
     59 - [Empty Graph](EmptyGraph.md)
     60 - [Bipartite](Bipartite.md)
     61 
     62 Ch 5 (Hashing)
     63 
     64 - [Hashing](Hashing.md)
     65 - [Homogeneous](Homogeneous.md)
     66 - [Hash Table](HashTable.md)
     67 - [Key](Key.md) 
     68 - [Hash Values](HashValues.md) 
     69 - [Hash Function](HashFunction.md) 
     70 - [Folding](Folding.md) 
     71 - [Arithmetic Computations](ArithmeticComputations.md) 
     72 - [Finite Field](FiniteField.md) 
     73 - [Collision](Collision.md)
     74 - [Linear Probing](LinearProbing.md) 
     75 - [Probing Function](ProbingFunction.md)
     76 - [Quadratic Probing](QuadraticProbing.md)
     77 - [Load Factor](LoadFactor.md)
     78 - [Chaining](Chaining.md)
     79 - [Bucket Addressing](BucketAddressing.md)
     80 
     81 Ch 6 (Information Theory and Data Compression)
     82 
     83 - InformationTheory
     84 - [Codeword](Codeword.md)
     85 - [Binary Code](BinaryCode.md)
     86 - [Entropy](Entropy.md)
     87 - [Information Content](InformationContent.md)
     88 - HuffmanCoding
     89 - RootedTree (ordered pair (T,r) where r is the root (arbitrary) and T is a graph (tree))
     90 - Leaf - Exactly one neighbor
     91 
     92 Ch 7 (Game Strategy)
     93 
     94 - FiniteTwoPlayerGameOfPureStrategy
     95 - Minimax
     96 - Negamax
     97 
     98 #### Other Stuff To Look At
     99 
    100 Operation types (operations done with n inputs)
    101 
    102 - [Unary Operations](UnaryOperations.md)
    103 - [Binary Operations](BinaryOperations.md)
    104 - [Nary Operations](NaryOperations.md)
    105 - [Variadic Operations](VariadicOperations.md)
    106 
    107 #### Intro To Algorithms (MIT)
    108 
    109 L1:
    110 
    111 - [Asymptotic Notation](AsymptoticNotation.md)
    112 - [Fundamental Operations](FundamentalOperations.md)
    113 
    114 L2:
    115 
    116 - [Linked Lists](LinkedLists.md)
    117 - [Data Structure Augmentation](DataStructureAugmentation.md)
    118 - [Amortization](Amortization.md)
    119 
    120 L4:
    121 
    122 - [Hashing](Hashing.md)
    123 - [Open Addressing](OpenAddressing.md)
    124 
    125 L5 (non-comparative sorting):
    126 
    127 - [Count Sort](CountSort.md)
    128 
    129 L6:
    130 
    131 - [Binary Tree](BinaryTree.md)
    132 
    133 #### Intro To Algorithms Textbook (CLRS)
    134 
    135 2.1
    136 
    137 - [Insertion Sort](InsertionSort.md)
    138 - [Loop Invariant](LoopInvariant.md)
    139 
    140 2.3
    141 
    142 - [Incremental](Incremental.md)
    143 - [Divide And Conquer](DivideAndConquer.md)
    144 - [Merge Sort](MergeSort.md)
    145 
    146 3.2
    147 
    148 - [Asymptotic Notation](AsymptoticNotation.md)
    149 - [Trichotomy](Trichotomy.md)
    150 - [Monotonic Function](MonotonicFunction.md)
    151 
    152 #### Other algorithms adjacent stuff
    153 
    154 - [Bekenstein Bound](BekensteinBound.md)
    155 - [Oracle Computer](OracleComputer.md)
    156 - [Invariance](Invariance.md)