Competitive Programming Theory

/
8 Comments
  • Input / Output
    • Integer Input / Output
    • Float Input / Output
    • Char Input / Output
    • String Input / Output
    • List Input / Output
    • Matrix Input / Output
  • Mathematics
    • Prime Number And Sieve of Eratosthenes
    • Modulo Arithmetic
    • Inverse Modulo
    • Fermat Little Theorem
    • GCF And LCM
    • Linear Diophantine
    • Extended Euclid
    • Combination And Permutation
    • Bit Manipulation
    • Big Number
    • Fast Exponentiation
    • Matrix Exponentiation
  • Computational Geometry
    • Vector And Operations
    • Area Calculation
    • Convex Hull
    • Line Intersection
  • Data Structure
    • Array
    • Bit Array
    • Graph
    • Tree
    • Disjoint Set
    • Binary Indexed Tree / Fenwick Tree
    • Binary Search Tree
    • Heap
    • AVL Tree
    • Treap
    • Segment Tree
    • Range Minimum Query (RMQ)
    • Range Tree
    • Suffix Tree
    • Suffix Trie
    • Suffix Array
    • Hash Table
  • STL
    • Vector
    • List
    • Set / Multi Set
    • Map / Multi Map
    • Stack
    • Queue
    • Priority Queue
  • Sorting
    • Bubble Sort
    • Selection Sort
    • Insertion Sort
    • Shell Sort
    • Quick Sort
    • Merge Sort
    • Count Sort
    • Radix Sort
    • Heap Sort
    • Topo Sort
  • Linear Data Searching
    • Linear Search
    • Binary Search
  • Graph Data Searching
    • Breadh First Search (BFS)
    • Depth First Search (DFS)
    • Depth Limited Search (DLS)
    • Iterative Deepening Depth First Search (IIDFS)
  • Path Finding & Shortest Path
    • Breadth First Search
    • Depth First Search
    • Floyd Warshall Algorithm
    • Bellman Ford Algorithm
    • Djikstra Algorithm
    • A Star (A*) Algorithm
  • Divide And Conquer
  • Dynamic Programming
    • Coin Change
    • Knapsack Zero One
    • Matrix Chain Multiplication (MCM)
    • Longest Increasing Subsequence (LIS)
    • Longest Common Subsequence (LCS)
    • Edit Distance
    • DP On Tree / DP On DAG
    • DP Bitmask
    • DP Profile
    • DP Convex Hull
  • Greedy
    • Coin Change
    • Fractional Knapsack
    • Interval Selection Problem
  • String Processing
    • Rabin Karp Algorithm
    • Knuth Morris Prat Algorithm

8 komentar:

  1. tambahin di bagian string, yaitu suffix array.. :D

    BalasHapus
    Balasan
    1. Oh iya suffix array... tapi bukannya bagusnya itu di bagian Data Structure?

      Hapus
  2. Tolong pasang jga link terkait pada masing2 topik tsb. Thanks

    BalasHapus
    Balasan
    1. Ahahahay :v... sorry akhir2 ini jarang update blog saya :v... rada sibuk... nanti kalau aku sudah nyante aku coba cari2 deh link yang berhubungan :D

      Hapus
    2. Oke2,
      Oiya, itu udah urut juga apa blm?

      Mksdnya, standart pembelajaran dari pemula hingga tingkat lanjut.

      Kalo urut, saya kira sebaiknya lebih didahulukan Data Structure sebelum Computational Geomatry

      Hapus
  3. Blom ngurut mah ini :v... ini cuman dimasukin di category aja :v... dan gak ngurutin... semuanya langsung aku cemplungin :v

    BalasHapus

alijaya. Diberdayakan oleh Blogger.