2021-09-22 17:23:25 +00:00
|
|
|
= Algorithms and Data structures =
|
|
|
|
|
|
|
|
|
|
Different ways to store and operate on data, with differing efficiency
|
|
|
|
|
|
|
|
|
|
== Sequential Data Structures ==
|
|
|
|
|
|
|
|
|
|
* [[array|Array]]
|
|
|
|
|
* [[vector|Vector]]
|
|
|
|
|
* [[linked_list|Linked List]]
|
|
|
|
|
* [[stack|Stack]]
|
|
|
|
|
* [[queue|Queue]]
|
2021-09-23 03:33:54 +00:00
|
|
|
* [[skip_list|Skip list]]
|
|
|
|
|
* [[hash_table|Hash Table]]
|
2022-04-25 16:30:01 +00:00
|
|
|
* [[DHT|Distributed Hash Table]]
|
2021-09-22 17:23:25 +00:00
|
|
|
|
|
|
|
|
== Non sequential Data Structures ==
|
|
|
|
|
|
|
|
|
|
* [[binary_tree|Binary Tree]]
|
2022-12-07 02:15:01 +00:00
|
|
|
* [[trie|Trie]] * [[graph|Graph]] * [[b_tree|B-Tree]]
|
2021-09-23 03:33:54 +00:00
|
|
|
* [[red_black_tree|Red Black Tree]]
|
|
|
|
|
* [[splay_tree|Splay Tree]]
|
|
|
|
|
* [[avl_tree|AVL Tree]]
|
|
|
|
|
* [[kd_tree|KD Tree]]
|
2022-02-02 20:00:01 +00:00
|
|
|
* [[Heap]]
|
2021-11-06 19:15:01 +00:00
|
|
|
- [[Fibonacci_heap]]
|
2022-09-12 20:49:14 +00:00
|
|
|
* [[priority_queue|Priority Queue]]
|
|
|
|
|
* [[merkle_tree|Merkle Tree]]
|
2021-09-23 03:33:54 +00:00
|
|
|
|
2022-02-02 20:00:01 +00:00
|
|
|
== Probabilistic Data Structures ==
|
|
|
|
|
|
2022-03-03 18:45:01 +00:00
|
|
|
* [[Bloom_filter|Bloom Filter]]
|
2022-02-02 20:00:01 +00:00
|
|
|
|
2021-11-05 19:45:01 +00:00
|
|
|
== Common Algorithms ==
|
|
|
|
|
|
2021-11-06 19:00:01 +00:00
|
|
|
=== Graph and Tree ===
|
|
|
|
|
|
2021-11-05 19:45:01 +00:00
|
|
|
* [[BFS]]
|
|
|
|
|
* [[DFS]]
|
2021-11-06 19:00:01 +00:00
|
|
|
* [[Dijkstra]]
|
2022-09-28 20:45:01 +00:00
|
|
|
* [[Bellman-Ford]]
|
2021-11-05 19:45:01 +00:00
|
|
|
|
2022-05-04 22:45:01 +00:00
|
|
|
=== Strings ===
|
|
|
|
|
|
|
|
|
|
* [[Damerau-Levenshtein]]
|
|
|
|
|
|
2021-09-23 03:33:54 +00:00
|
|
|
== Sorting ==
|
|
|
|
|
|
|
|
|
|
* [[quicksort|Quicksort]]
|
|
|
|
|
* [[mergesort|Mergesort]]
|
|
|
|
|
* [[heapsort|Heapsort]]
|
|
|
|
|
* [[radix|Radix]]
|
|
|
|
|
* [[bucket|Bucket]]
|
|
|
|
|
* [[counting|Counting]]
|
2021-09-22 17:23:25 +00:00
|
|
|
|
2021-09-23 17:54:24 +00:00
|
|
|
== Paradigms ==
|
|
|
|
|
|
|
|
|
|
* [[simple_recurison|Simple Recursion]]
|
|
|
|
|
* [[divide_and_conquer|Divide and Conquer]]
|
|
|
|
|
* [[dynamic_programming|Dynamic Programming]]
|
|
|
|
|
* [[greedy_algorithm|Greedy Algorithms]]
|
|
|
|
|
* [[brute_force|Brute Force]]
|
|
|
|
|
* [[randomized_algorithm|Randomized Algorithms]]
|
2021-10-11 03:22:53 +00:00
|
|
|
* [[genetic|Genetic Algorithms]]
|
|
|
|
|
* [[swarm|Swarm Inteligence]]
|
2022-02-27 03:45:01 +00:00
|
|
|
* [[machine_learning|Machine Learning]]
|
2021-10-11 03:22:53 +00:00
|
|
|
* [[neural|Neural Networks]]
|
|
|
|
|
|
2022-11-11 01:08:11 +00:00
|
|
|
== Graphics ==
|
|
|
|
|
|
|
|
|
|
* [[gradiant|Gradiant]]
|
|
|
|
|
* [[prewitt-operator|Prewitt-operator]]
|
|
|
|
|
* [[light_transport|Light Transport]]
|
|
|
|
|
|
2022-03-16 02:30:01 +00:00
|
|
|
== Programming patterns ==
|
|
|
|
|
|
|
|
|
|
=== Creational ===
|
|
|
|
|
|
|
|
|
|
* [[singleton]]
|
|
|
|
|
* [[prototype]]
|
2022-03-16 02:45:01 +00:00
|
|
|
* [[builder]]
|
2022-03-16 02:30:01 +00:00
|
|
|
|
|
|
|
|
=== Structural ===
|
|
|
|
|
|
2022-03-16 02:45:01 +00:00
|
|
|
* [[composite]]
|
|
|
|
|
|
2022-03-16 02:30:01 +00:00
|
|
|
=== Behavioral ===
|
|
|
|
|
|
2022-09-12 20:49:14 +00:00
|
|
|
* [[factory]]
|
|
|
|
|
* [[facade]]
|
|
|
|
|
* [[proxy]]
|
|
|
|
|
* [[iterator]]
|
|
|
|
|
* [[observer]]
|
|
|
|
|
* [[mediator]]
|
|
|
|
|
* [[state]]
|
2022-03-16 02:30:01 +00:00
|
|
|
|
2021-10-11 03:22:53 +00:00
|
|
|
== Common operations ==
|
|
|
|
|
|
|
|
|
|
* [[gcd]] - Find the GCD of two numbers
|
2021-12-15 20:45:01 +00:00
|
|
|
* [[modular_exponentiation|Modular Exponentiation]] - Solve a^b mod n
|
2021-09-23 17:54:24 +00:00
|
|
|
|
2022-03-30 19:00:01 +00:00
|
|
|
== Misc ==
|
|
|
|
|
|
|
|
|
|
* [[p_vs_np]]
|
2022-05-04 00:45:01 +00:00
|
|
|
* [[quadratic_probing]]
|
2022-03-30 19:00:01 +00:00
|
|
|
|
2021-09-23 17:54:24 +00:00
|
|
|
[[index]]
|
