data_structures/notes.txt at main · CesarObedFL/data_structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
    MISSING DATA STRUCTURES

- Linked Nodes
    - Edges     // Edge represents a path between two vertices or a line between two vertices in a graph
    - Vertex    // Each node of the graph is represented as a vertex.

- Queues
    - Posfix Notation Queues
    - Infix Notation Queues
    - Heaps or Priority Queues

- Stacks
    - Verification of Parentheses and Balanced Expressions
    - Backtracking

- Trees
    - Tree Routes (Preorder, Inorder, Postorder & Level Route)
    - Binary Trees
    - AVL Tree
    - Trie Tree or Prefix
    - Suffix Tree
    - Segment Tree
    - Decision Tree
    - Huffman Tree
    - Fenwick Tree (Binary Indexed Tree)

- Graphs
    - Breadth-First Search (BFS)
    - Depth-First Search (DFS)
    - Dijkstra
    - Prim
    - Bellman-Ford
    - Kruskal
    - Floyd-Warshall
    - Cycle Detection
    - Algorithm of Shortest Paths in Communication Networks (OSPF)
    - Minimum Spanning Tree


    MISSING ALGORITHMS

- Sorting Methods
    - Bubble Sort
    - Insertion Sort
    - Selection Sort
    - Merge Sort
    - Quick Sort
    - Heap Sort
    - Counting Sort
    - Radix Sort
    - Bucket Sort

- Compression
    - Huffman
    - Cesar
    - Lempel-Ziv-Welsh (LZW)
    - Burrows-Wheeler Transform (BWT)
    - LZ77
    - Deflate
    - GZIP
    - ZIP

- Serialization

- Encryption
    - Advanced Encryption Standard (AES)
    - Rivest-Shamir-Adleman (RSA)
    - Digital Signature Algorithm (DSA)
    - ElGamal

- Hash Tables
    - Separate Chaining
    - Open Addressing
    - Universal Hash
    - Cuckoo Hashing
    - Perfect Hashing
    - Extendible Hashing
    - Linear Hashing

    TO DO LIST

- Dinamic size on static dsa's
- Administration classes