User:Amay sh85/Books/Computer Science

Computer Science

 * Searching
 * Introduction to Algorithms
 * The Art of Computer Programming
 * Big O notation
 * Time complexity
 * Binary search algorithm
 * Dynamic programming
 * Brute-force search
 * Backtracking
 * Linear programming
 * Graph (mathematics)
 * Decision problem
 * Optimization problem
 * Modular exponentiation


 * Sorting
 * Merge sort
 * Quicksort
 * Insertion sort
 * Heapsort
 * Sorting algorithm
 * Divide and conquer algorithm
 * Best, worst and average case
 * Selection sort
 * In-place algorithm
 * Donald Knuth
 * Bubble sort
 * Prime number
 * Wheel factorization
 * Trial division
 * Sieve of Atkin
 * Prime factor
 * Integer factorization
 * Wilson's theorem
 * Divergence of the sum of the reciprocals of the primes
 * Context of computational complexity
 * Online algorithm


 * Algorithm
 * Longest increasing subsequence
 * Longest common substring problem
 * Longest common subsequence problem
 * Knapsack problem
 * Travelling salesman problem
 * Primality test
 * Miller–Rabin primality test
 * Sieve of Eratosthenes
 * Cryptography
 * NP (complexity)
 * P (complexity)
 * Computational complexity theory
 * Greatest common divisor
 * Randomized algorithm


 * Operating System
 * Kernel (computing)
 * Edit distance
 * Trie
 * Deterministic finite automaton
 * Radix tree
 * Bit array
 * Ternary search tree
 * Knuth–Morris–Pratt algorithm
 * Damerau–Levenshtein distance
 * BK-tree
 * Bloom filter