notes

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

Algorithms.md (3882B)

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