Update for 05-11-21 15:45

This commit is contained in:
Tyler Perkins 2021-11-05 15:45:01 -04:00
parent fa8ab6b629
commit bcca992f03
6 changed files with 36 additions and 0 deletions

View File

@ -12,3 +12,7 @@ The purest study of them all
* [[relative_prime]] * [[relative_prime]]
* [[modular_inverse]] * [[modular_inverse]]
* [[euclidean_algorithm]] * [[euclidean_algorithm]]
=== Computer Science ===
* [[markov_chain]]

9
math/markov_chain.wiki Normal file
View File

@ -0,0 +1,9 @@
= Markov Chains =
Markov chains are a way of representing states and the probablility of other
states occouring, when a given state is present. A markov chain is a type of
state diagram.
== Explanation ==
A markov chain is often represented as a

1
tech/BFS.wiki Normal file
View File

@ -0,0 +1 @@
= Breadth First Search =

1
tech/DFS.wiki Normal file
View File

@ -0,0 +1 @@
= Depth First Search =

View File

@ -22,6 +22,11 @@ Different ways to store and operate on data, with differing efficiency
* [[avl_tree|AVL Tree]] * [[avl_tree|AVL Tree]]
* [[kd_tree|KD Tree]] * [[kd_tree|KD Tree]]
== Common Algorithms ==
* [[BFS]]
* [[DFS]]
== Sorting == == Sorting ==
* [[quicksort|Quicksort]] * [[quicksort|Quicksort]]

16
tech/graph.wiki Normal file
View File

@ -0,0 +1,16 @@
= Graph =
A Graph is a type of data structure consisting of nodes and linkages between
these nodes, often represented as pointers. Links between nodes can have the
option of carrying associated weights or costs to them. They can also either be
directional, bi-directional, or carry no direction.
Any link between two nodes is known as an *edge*, while the nodes are often
known as *vertexes*. Graphs can be used for a large variety of modeling
exercises, including Social networks, computer networks, and abstract
applications including [[../math/markov_chain|Markov Chians]].
== Algorithms ==
* [[BFS]]
* [[DFS]]