# Computer Science ## Algorithms - [[Sorting Algorithm]] > [!List of Algorithms by Type]- > ### Graph Algorithms > - [[Kahn's Algorithm]] > #### Graph Traversal > - [[Breadth-First Search]] > - [[Depth-First Search]] > #### Flow Networks > - [[Ford-Fulkerson Algorithm]] > - [[Edmonds-Karp Algorithm]] > #### Strongly Connected Components > - [[Kosaraju's Algorithm]] > - [[Tarjan's Algorithm]] > #### Shortest Path Problem > - [[Bellman-Ford Algorithm]] > - [[Breadth-First Search#Shortest path problem|Breadth-First Search]] > - [[Dijkstra's Algorithm]] > - [[Floyd-Warshall Algorithm]] > - [[Topological Sorting#Shortest path problem|Topological Sorting algorithm]] > ### Multiplication Algorithms > - [[Baugh-Wooley Algorithm]] > - [[Karatsuba's Algorithm]] > ### Search Algorithms > - [[Binary Search]] > ### Sorting Algorithms > - [[Insertion Sort]] > - [[Merge Sort]] > - [[Quicksort]] ### Algorithm Design Paradigms - [[Divide and Conquer]] - [[Dynamic Programming]] - [[Greedy Algorithm]] ### Analysis of Algorithms - [[Master Theorem]] #### Complexity Theory - [[Nondeterministic Polynomial Time]] - [[NP-Complete]] - [[Polynomial Time]] - [[Polynomial Time Reduction]] - [[NP-Hard]] - **[[Time Complexity]]** *** ## Coding - [[Bit Shift]] ### Languages #### Assembly - [[ARMv4T Assembly]] - [[ARMv4T Assembly Directives]] - [[ARMv4T Assembly Pseudo-Instructions]] #### SQL - [[Join]] *** ## Computability - [[Turing Machine]] *** ## Computer Architecture - [[Instruction Set Architecture]] - [[Load-Store Architecture]] - [[ARM7TDMI]] - [[ARM Instruction Encoding]] *** ## Data Structures - [[Queue]] - [[Stack]] - [[Tree, data structure#Data structure|Tree]] - [[Binary Search Tree]] - [[AVL Tree]] - [[Heap]] - [[Binary Heap]] - [[Fibonacci Heap]] - [[Trie]]