Mastering Algorithms With C - Kyle Loudon [242]
extract element, Return Value
heap for, Implementation and Analysis of Priority Queues
implementation and analysis of, Implementation and Analysis of Priority Queues
initialize, Return Value
insert element, Return Value
interface for, Interface for Priority Queues
peek, Return Value
size of, Return Value
starvation, Questions and Answers
probing, Collision Resolution, Linear probing, Double hashing, Implementation and Analysisof Open Addressed Hash Tables, Related Topics, Related Topics
by double hashing, Double hashing
linear, Linear probing, Related Topics
quadratic, Related Topics
process_event function, Queue Example: Event Handling
producer-consumer problem, Stacks and Queues
program stack, Stacks and Queues
programming practices, A Bit About Software Engineering
public interface, An Introduction to Data Structures, A Bit About Software Engineering
public-key ciphers, Data Encryption, Description of RSA
Q
qksort function, qksort
qsrt function, Questions and Answers
Queue structure, queue_init
queues, Stacks and Queues, Description of Queues, Interface for Queues, Return Value, Return Value, Return Value, Return Value, Return Value, Return Value, Implementation and Analysis of Queues, queue_init, queue_destroy, queue_enqueue, queue_dequeue, queue_ peek, queue_size, queue_ peek, queue_size, Queue Example: Event Handling, Queue Example: Event Handling, Queue Example: Event Handling, Queue Example: Event Handling, Related Topics, Related Topics, Heaps and Priority Queues
circular, Related Topics
dequeue, Return Value, queue_dequeue
dequeue event, Queue Example: Event Handling
destroy, Return Value, queue_destroy
double-ended, Related Topics
enqueue, Return Value, queue_enqueue
enqueue event, Queue Example: Event Handling
event handling, Queue Example: Event Handling
example of, Queue Example: Event Handling
implementation and analysis of, Implementation and Analysis of Queues
initialize, Return Value, queue_init
interface for, Interface for Queues
peek, Return Value, queue_ peek, queue_size
size of, Return Value, queue_ peek, queue_size
queue_dequeue, queue_dequeue, Return Value, queue_dequeue
queue_destroy, Return Value, queue_destroy
queue_enqueue, queue_enqueue, Return Value, queue_enqueue
queue_init, Return Value, queue_init
queue_peek, queue_ peek, Return Value, queue_ peek, queue_size
queue_size, queue_size, Return Value, queue_ peek, queue_size
quick rejection test, Computer Test for Intersecting Line Segments
quicksort, Randomized algorithms, Sorting and Searching, Description of Quicksort, Description of Quicksort, Description of Quicksort, Interface for Quicksort, Implementation and Analysis of Quicksort, Implementation and Analysis of Quicksort, Quicksort Example: Directory Listings, Questions and Answers, Questions and Answers
description of, Description of Quicksort
example of, Quicksort Example: Directory Listings
implementation and analysis of, Implementation and Analysis of Quicksort
interface for, Interface for Quicksort
median-of-three method, Description of Quicksort
partitioning, Implementation and Analysis of Quicksort
wrapper, Questions and Answers
R
radix sort, Sorting and Searching, Description of Radix Sort, Description of Radix Sort, Description of Radix Sort, Description of Radix Sort, Description of Radix Sort, Interface for Radix Sort, Implementation and Analysis of Radix Sort, Questions and Answers, Questions and Answers
counting sort, Description of Radix Sort
description of, Description of Radix Sort
digits, Description of Radix Sort
implementation and analysis of, Implementation and Analysis of Radix Sort
interface for, Interface for Radix Sort
stable requirement, Description of Radix Sort
random number generators, Related Topics
randomized algorithms, Randomized algorithms
readability of code, A Bit About Software Engineering
receive_event function, Queue Example: Event Handling
rectilinear coordinate