• Choose a category
• All
• Classic-Fiction

interface for, Interface for Heaps

k-ary, Related Topics

partial ordering, Description of Heaps

reheapify, heap_insert, heap_extract

size of, Return Value, heap_size

stored as arrays, Description of Heaps

top-heavy, Description of Heaps

heapsort, Heaps and Priority Queues, Related Topics

heap_destroy, Return Value, heap_destroy, heap_size

heap_extract, Return Value, heap_extract, heap_size

heap_init, Return Value, heap_init, heap_size

heap_insert, Return Value, heap_insert, heap_size, Questions and Answers

heap_left, heap_size, heap_size, Questions and Answers

heap_parent, heap_size, heap_size, heap_size

heap_right, heap_size, heap_size, Questions and Answers

heap_size, Return Value, heap_size

heuristic, Approximation algorithms

hide function, bistree_remove, bistree_size, bistree_size

hierarchical file system, Quicksort Example: Directory Listings

HuffCode structure, Data Compression

Huffman coding, Greedy algorithms, Greedy algorithms, Trees, Data Compression, Description of Huffman Coding, Description of Huffman Coding, Description of Huffman Coding, Entropy and Minimum Redundancy, Entropy and Minimum Redundancy, Building a Huffman Tree, Building a Huffman Tree, Compressing and Uncompressing Data, Effectiveness of Huffman Coding, Interface for Huffman Coding, Implementation and Analysis of Huffman Coding, huffman_compress, huffman_compress, Huffman Coding Example: Optimized Networking, Huffman Coding Example: Optimized Networking, Huffman Coding Example: Optimized Networking, Questions and Answers, Questions and Answers, Questions and Answers, Questions and Answers, Related Topics

adaptive, Related Topics

build code table, huffman_compress

compressing/uncompressing data, Compressing and Uncompressing Data

description of, Description of Huffman Coding

effectiveness, Effectiveness of Huffman Coding, Questions and Answers

end of data, Questions and Answers

entropy, Entropy and Minimum Redundancy

frequency, Entropy and Minimum Redundancy, huffman_compress

header, Questions and Answers

Huffman codes, Building a Huffman Tree

Huffman trees, Greedy algorithms, Building a Huffman Tree

implementation and analysis of, Implementation and Analysis of Huffman Coding

interface for, Interface for Huffman Coding

minimum redundancy coding, Description of Huffman Coding

optimized networking, Huffman Coding Example: Optimized Networking

receive compressed data, Huffman Coding Example: Optimized Networking

send compressed data, Huffman Coding Example: Optimized Networking

vs. Lempel-Ziv-1977 (LZ77), Questions and Answers

huffman_compress function, huffman_compress, huffman_compress, huffman_uncompress, Huffman Coding Example: Optimized Networking

huffman_uncompress function, huffman_uncompress, huffman_uncompress, huffman_uncompress, Huffman Coding Example: Optimized Networking

HuffNode structure, Data Compression, huffman_compress

hypergraphs, Related Topics

I

in-place sorts, Sorting and Searching

incidence, Description of Graphs

incremental sorting, Description of Insertion Sort

industrial-grade primes, Related Topics

infix expressions, Binary Tree Example: Expression Processing

information theory, Data Compression, Data Encryption

initial permutation, Enciphering and Deciphering Data Blocks

initialization vector, DES Example: Block Cipher Modes

inorder function, Binary Tree Example: Expression Processing, Binary Tree Example: Expression Processing

inorder traversal, Inorder traversal, Binary Tree Example: Expression Processing

insertion sort, Analysis Example: Insertion Sort, Analysis Example: Insertion Sort, Sorting and Searching, Description of Insertion Sort, Description of Insertion Sort, Interface for Insertion Sort, Implementation and Analysis of Insertion Sort, Questions and Answers

description of, Description of Insertion Sort

implementation and analysis of, Implementation and Analysis of Insertion Sort

interface for, Interface for Insertion Sort

integers, large, Related Topics

internets,