time-complexity-flashcards/info.js at main · abarrus/time-complexity-flashcards · 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
import { O, Type, Collection, SortAlgorithm, Item } from "./items.js"

export const collections = [
    new Item("HashMap", Type.COLLECTION, new Collection(
        O.CONSTANT
    )),
    new Item("set()", Type.COLLECTION, new Collection(
        O.CONSTANT
    )),
    new Item("dict()", Type.COLLECTION, new Collection(
        O.CONSTANT
    )),
    new Item("ArrayList", Type.COLLECTION, new Collection(
        O.LINEAR, O.LINEAR, O.CONSTANT, O.LINEAR
    )),
    new Item("TreeSet", Type.COLLECTION, new Collection(
        O.LOGARITHMIC
    )),
    new Item("Binary Search Tree", Type.COLLECTION, new Collection(
        O.LOGARITHMIC
    )),
    new Item("Heap", Type.COLLECTION, new Collection(
        O.LOGARITHMIC, O.LOGARITHMIC, O.LINEAR, O.LINEAR
    )),
    new Item("Queue", Type.COLLECTION, new Collection(
        O.CONSTANT, O.CONSTANT, O.CONSTANT, O.LINEAR
    ))
]

export const sortingAlgorithms = [
    new Item("Selection Sort", Type.SORT, new SortAlgorithm(
        O.QUADRATIC
    )),
    new Item("Insertion Sort", Type.SORT, new SortAlgorithm(
        O.LINEAR, O.QUADRATIC, O.QUADRATIC
    )),
    new Item("Merge Sort", Type.SORT, new SortAlgorithm(
        O.LINEARITHMIC
    )),
    new Item("Quicksort", Type.SORT, new SortAlgorithm(
        O.LINEARITHMIC, O.QUADRATIC, O.LINEARITHMIC
    )),
]