Mastering Algorithms With C - Kyle Loudon [229]
multiplication method, Multiplication method
remove element, Return Value, chtbl_remove
size of, Return Value, chtbl_size
symbol tables, Chained Hash Table Example: Symbol Tables
uniform hashing, Collision Resolution
child nodes, Trees, Description of Binary Trees
chromatic number, Graphs
CHTbl structure, Implementation and Analysis of Chained Hash Tables
chtble_insert, Return Value, chtbl_insert
chtble_lookup, Return Value, chtbl_lookup
chtbl_destroy, Return Value, chtbl_destroy
chtbl_init, Return Value, chtbl_init, chtbl_size
chtbl_insert, chtbl_size
chtbl_lookup, chtbl_size
chtbl_remove, Return Value, chtbl_remove, chtbl_size
chtbl_size, Return Value, chtbl_size
cipher block chaining (CBC), DES Example: Block Cipher Modes, DES Example: Block Cipher Modes
cipher feedback (CFB), Related Topics
ciphers, Data Encryption
ciphertext, Data Encryption
circular lists, Linked Lists, Description of Circular Lists, Description of Circular Lists, Return Value, Return Value, Return Value, Return Value, Return Value, Return Value, Implementation and Analysis of Circular Lists, clist_init, clist_destroy, clist_ins_next, clist_rem_next, Circular List Example: Second-Chance Page Replacement, Circular List Example: Second-Chance Page Replacement, Circular List Example: Second-Chance Page Replacement, Circular List Example: Second-Chance Page Replacement, Questions and Answers, Related Topics
description of, Description of Circular Lists
destroy, Return Value, clist_destroy
doubly-linked, Related Topics
example of, Circular List Example: Second-Chance Page Replacement, Circular List Example: Second-Chance Page Replacement
implementation and analysis of, Implementation and Analysis of Circular Lists
initialize, Return Value, clist_init
insert next element, Return Value, clist_ins_next
insertion before head, Questions and Answers
next element, Return Value
remove element, Return Value, clist_rem_next
second-chance page replacement, Circular List Example: Second-Chance Page Replacement, Circular List Example: Second-Chance Page Replacement
size of, Return Value
circular queues, Related Topics
cliques, Graphs
CList structure, Implementation and Analysis of Circular Lists
CListElmt structure, Implementation and Analysis of Circular Lists
clist_data, Return Value
clist_destroy, Return Value, clist_destroy
clist_head, Return Value
clist_init, Return Value, clist_init
clist_ins_next, Return Value, clist_ins_next
clist_next, Return Value
clist_rem_next, Return Value, clist_rem_next
clist_size, Return Value
clock algorithm, Circular List Example: Second-Chance Page Replacement
closed transport systems, Graph Algorithms
collinear points, Computer Test for Intersecting Line Segments
collision resolution, Hash Tables, Collision Resolution, Collision Resolution
coloring graphs, Graphs
combinatorics, Set Example: Set Covering
comments, A Bit About Software Engineering
communications networks, Graph Algorithms
compare_dir function, Quicksort Example: Directory Listings
compare_freq function, huffman_uncompress
compare_int function, Implementation and Analysis of Quicksort
compare_str function, Binary Search Example: Spell Checking
compare_win function, lz77_uncompress
comparison sorts, Sorting and Searching
compile-time errors from pointers, Questions and Answers
compilers, Related Topics, Chained Hash Table Example: Symbol Tables, Chained Hash Table Example: Symbol Tables
compiler design, Related Topics
hash tables, Chained Hash Table Example: Symbol Tables
complete graphs, Description of Graphs
complexity, Computational Complexity (see computational complexity)
components of vectors, Related Topics
compression, Data Compression (see data compression)
compression ratio, Data Compression
computational complexity, Computational Complexity, Computational Complexity, Computational Complexity, Computational Complexity, Questions and Answers, Questions and Answers
relation to running time, Computational Complexity
table of situations, Computational