Indeks

Symbole

?, [1]

A

amortyzacja, [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21]

asymptotycznie optymalny, [1], [2], [3], [4], [5], [6], [7] AVL, [1], [2], [3], [4], [5]

B

BST, [1], [2], [3], [4], [5], [6]

Bubble Sort, [1]

D

DFS, [1] drzewa, [1], [2]

drzewo sufiksowe, [1], [2], [3] dwudzielne dwuspójność

F

Find-Union, [1], [2], [3], [4], [5], [6], [7], [8], [9]

G

geometria, [1] grafy, [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] BFS DFS, [1], [2] dwuspójność, [1] kaktusy, [1], [2], [3], [4] MST, [1] najkrótsze ścieżki przepływy skojarzenia

H

Heap Sort

I

inwersje

K

KMP kolejka kolejka dwumianowa, [1]

kolejka lewicowa, [1] kopiec, [1], [2], [3] kubełkowe, [1]

L

listy, [1]

M

max	Merge Sort, [1]

N

najdłuższy podciąg rosnący

najkrótsze ścieżki

O

optymalne porównania, [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17]

P

planarne

programowanie dynamiczne, [1], [2]

Q

Quick Sort, [1], [2]

S

scalanie Selection Sort sortowanie, [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] Insertion Sort Merge Sort Quick Sort scalanie Splay stabilnie statystyki pozycyjne, [1], [2], [3]

struktury danych, [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] 2-3-4-drzewa AVL, [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11] B-drzewa BST, [1], [2] BST; struktury danych; AVL kolejka dwumianowa kolejka lewicowa, [1] kopiec RB, [1] wzbogacanie, [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18]

T

teksty, [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20]

Treap

W

w miejscu, [1], [2] wyszukiwanie max

wzbogacanie, [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]