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